default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJácint Szabó
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j22]Yanjun Li, Jácint Szabó:
An Edmonds-Gallai-Type Decomposition for the j-Restricted k-Matching Problem. Electron. J. Comb. 27(1): 1 (2020)- [j21]András Recski, Jácint Szabó:
Generalized matroid matching. Discret. Appl. Math. 276: 129-133 (2020)
2010 – 2019
- 2019
- [j20]Raimond Wüst, Stephan Bütikofer, Severin Ess, Claudio Gomez, Albert Steiner
, Marco Laumanns, Jácint Szabó:
Maintenance timetable planning based on mesoscopic infrastructure and the transport service intention. J. Rail Transp. Plan. Manag. 11 (2019) - [j19]Fabian L. Müller, Jácint Szabó, Olle Sundström, John Lygeros:
Aggregation and Disaggregation of Energetic Flexibility From Distributed Energy Resources. IEEE Trans. Smart Grid 10(2): 1205-1214 (2019) - 2018
- [j18]Kristóf Bérczi, Alpár Jüttner, Marco Laumanns, Jácint Szabó:
Arrival time dependent routing policies in public transport. Discret. Appl. Math. 251: 93-102 (2018) - [j17]Sabrina Herrigel, Marco Laumanns, Jácint Szabó, Ulrich Weidmann:
Periodic railway timetabling with sequential decomposition in the PESP model. J. Rail Transp. Plan. Manag. 8(Issues): 167-183 (2018) - [c9]Raimond Wüst, Stephan Bütikofer, Severin Ess, Claudio Gomez, Albert Steiner, Marco Laumanns, Jácint Szabó:
Periodic Timetabling with 'Track Choice'-PESP Based on Given Line Concepts and Mesoscopic Infrastructure. OR 2018: 571-578 - 2017
- [c8]Jácint Szabó, Sebastien Blandin, Charles Brett:
Data-Driven Simulation and Optimization for Incident Response in Urban Railway Networks. AAMAS 2017: 819-827 - [c7]Ioana Giurgiu, Jácint Szabó, Dorothea Wiesmann, John Bird:
Predicting DRAM reliability in the field with machine learning. Middleware Industry 2017: 15-21 - [i3]Fabian L. Mueller, Jácint Szabó, Olle Sundström, John Lygeros:
Aggregation and Disaggregation of Energetic Flexibility from Distributed Energy Resources. CoRR abs/1705.02815 (2017) - 2015
- [c6]Fabian L. Mueller, Olle Sundström, Jácint Szabó, John Lygeros:
Aggregation of energetic flexibility using zonotopes. CDC 2015: 6564-6569 - 2013
- [j16]Attila Bernáth, Tamás Király, Erika R. Kovács, Gergely Mádi-Nagy, Gyula Pap, Júlia Pap, Jácint Szabó, László A. Végh:
Algorithms for multiplayer multicommodity flow problems. Central Eur. J. Oper. Res. 21(4): 699-712 (2013) - 2012
- [j15]Yusuke Kobayashi, Jácint Szabó, Kenjiro Takazawa:
A proof of Cunningham's conjecture on restricted subgraphs and jump systems. J. Comb. Theory B 102(4): 948-966 (2012) - 2011
- [j14]Zsolt Fekete, Jácint Szabó:
Equitable Partitions to Spanning Trees in a Graph. Electron. J. Comb. 18(1) (2011) - [j13]Jácint Szabó:
Upgrading edge-disjoint paths in a ring. Discret. Optim. 8(2): 206-214 (2011) - 2010
- [j12]Zoltán Király, Jácint Szabó:
Induced Graph Packing Problems. Graphs Comb. 26(2): 243-257 (2010) - [i2]Johanna Becker, Zsolt Csizmadia, Alexandre Laugier, Jácint Szabó, László Szegö:
Balancing congestion for unsplittable routing on a bidirected ring. CoRR abs/1006.0193 (2010) - [i1]István Bíró, Jácint Szabó:
Large scale link based latent Dirichlet allocation for web document classification. CoRR abs/1006.4953 (2010)
2000 – 2009
- 2009
- [j11]Marek Janata, Jácint Szabó:
The superstar packing problem. Comb. 29(1): 27-48 (2009) - [j10]Tamás Király, Jácint Szabó:
A note on parity constrained orientations. Comb. 29(5): 619-628 (2009) - [j9]Mikio Kano, Gyula Y. Katona, Jácint Szabó:
Elementary Graphs with Respect to f-Parity Factors. Graphs Comb. 25(5): 717-726 (2009) - [j8]Jácint Szabó:
Good characterizations for some degree constrained subgraphs. J. Comb. Theory B 99(2): 436-446 (2009) - [c5]István Bíró, Dávid Siklósi, Jácint Szabó, András A. Benczúr:
Linked latent Dirichlet allocation in web spam filtering. AIRWeb 2009: 37-40 - [c4]István Bíró, Jácint Szabó:
Latent Dirichlet Allocation for Automatic Document Categorization. ECML/PKDD (2) 2009: 430-441 - 2008
- [j7]Márton Makai, Jácint Szabó:
The parity problem of polymatroids without double circuits. Comb. 28(6): 679-692 (2008) - [j6]András Frank, Lap Chi Lau, Jácint Szabó:
A note on degree-constrained subgraphs. Discret. Math. 308(12): 2647-2648 (2008) - [j5]Jácint Szabó:
Packing Trees with Constraints on the Leaf Degree. Graphs Comb. 24(5): 485-494 (2008) - [j4]Jácint Szabó:
Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski. SIAM J. Discret. Math. 22(3): 854-860 (2008) - [c3]István Bíró, Jácint Szabó, András A. Benczúr:
Latent dirichlet allocation in web spam filtering. AIRWeb 2008: 29-32 - [c2]István Bíró, András A. Benczúr, Jácint Szabó, Ana Gabriela Maguitman:
A Comparative Analysis of Latent Variable Models for Web Page Classification. LA-WEB 2008: 23-28 - 2007
- [c1]Márton Makai, Gyula Pap, Jácint Szabó:
Matching Problems in Polymatroids Without Double Circuits. IPCO 2007: 167-181 - 2006
- [j3]David Hartvigsen, Pavol Hell, Jácint Szabó:
The k-piece packing problem. J. Graph Theory 52(4): 267-293 (2006) - [j2]Johanna Becker, Zsolt Csizmadia, Jérôme Galtier, Alexandre Laugier, Jácint Szabó, László Szegö:
An integer programming approach to routing in daisy networks. Networks 47(2): 116-121 (2006) - 2005
- [j1]Marek Janata, Martin Loebl, Jácint Szabó:
The Edmonds-Gallai Decomposition for the k-Piece Packing Problem. Electron. J. Comb. 12 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
