Jácint Szabó

According to our database1, Jácint Szabó authored at least 33 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Generalized matroid matching.
Discret. Appl. Math., 2020

An Edmonds-Gallai-Type Decomposition for the j-Restricted k-Matching Problem.
Electron. J. Comb., 2020

2019
Aggregation and Disaggregation of Energetic Flexibility From Distributed Energy Resources.
IEEE Trans. Smart Grid, 2019

Maintenance timetable planning based on mesoscopic infrastructure and the transport service intention.
J. Rail Transp. Plan. Manag., 2019

2018
Periodic railway timetabling with sequential decomposition in the PESP model.
J. Rail Transp. Plan. Manag., 2018

Arrival time dependent routing policies in public transport.
Discret. Appl. Math., 2018

Periodic Timetabling with 'Track Choice'-PESP Based on Given Line Concepts and Mesoscopic Infrastructure.
Proceedings of the Operations Research Proceedings 2018, 2018

2017
Predicting DRAM reliability in the field with machine learning.
Proceedings of the 18th ACM/IFIP/USENIX Middleware Conference: Industrial Track, Las Vegas, NV, USA, December 11, 2017

Data-Driven Simulation and Optimization for Incident Response in Urban Railway Networks.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2015
Aggregation of energetic flexibility using zonotopes.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015

2013
Algorithms for multiplayer multicommodity flow problems.
Central Eur. J. Oper. Res., 2013

2012
A proof of Cunningham's conjecture on restricted subgraphs and jump systems.
J. Comb. Theory, Ser. B, 2012

2011
Upgrading edge-disjoint paths in a ring.
Discret. Optim., 2011

Equitable Partitions to Spanning Trees in a Graph.
Electron. J. Comb., 2011

2010
Induced Graph Packing Problems.
Graphs Comb., 2010

Large scale link based latent Dirichlet allocation for web document classification
CoRR, 2010

Balancing congestion for unsplittable routing on a bidirected ring
CoRR, 2010

2009
Good characterizations for some degree constrained subgraphs.
J. Comb. Theory, Ser. B, 2009

Elementary Graphs with Respect to <i>f</i>-Parity Factors.
Graphs Comb., 2009

A note on parity constrained orientations.
Comb., 2009

The superstar packing problem.
Comb., 2009

Latent Dirichlet Allocation for Automatic Document Categorization.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2009

Linked latent Dirichlet allocation in web spam filtering.
Proceedings of the AIRWeb 2009, 2009

2008
Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski.
SIAM J. Discret. Math., 2008

Packing Trees with Constraints on the Leaf Degree.
Graphs Comb., 2008

A note on degree-constrained subgraphs.
Discret. Math., 2008

The parity problem of polymatroids without double circuits.
Comb., 2008

A Comparative Analysis of Latent Variable Models for Web Page Classification.
Proceedings of the Latin American Web Conference, 2008

Latent dirichlet allocation in web spam filtering.
Proceedings of the AIRWeb 2008, 2008

2007
Matching Problems in Polymatroids Without Double Circuits.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
An integer programming approach to routing in daisy networks.
Networks, 2006

The <i>k</i>-piece packing problem.
J. Graph Theory, 2006

2005
The Edmonds-Gallai Decomposition for the k-Piece Packing Problem.
Electron. J. Comb., 2005


  Loading...