| Publication | Date of Publication | Type |
|---|
How many matchings cover the nodes of a graph?
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Problems and results on 1-cross-intersecting set pair systems
Combinatorics, Probability and Computing | 2023-11-08 | Paper |
Upper bounds for the necklace folding problems
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
Upper bounds for the necklace folding problems
| 2020-05-26 | Paper |
Optimal and heuristic network coding algorithms for multi-layered video broadcast
Networks | 2019-08-12 | Paper |
Linear time local approximation algorithm for maximum stable marriage
Algorithms | 2019-03-26 | Paper |
The Manickam-Mikl\'os-Singhi Parameter of Graphs and Degree Sequences
| 2018-08-17 | Paper |
Acyclic orientations with degree constraints
| 2018-06-09 | Paper |
Spanning tree with lower bound on the degrees
Discrete Applied Mathematics | 2018-04-20 | Paper |
On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs
The Electronic Journal of Combinatorics | 2018-01-15 | Paper |
Covering complete partite hypergraphs by monochromatic components
Discrete Mathematics | 2017-09-18 | Paper |
Packing tree degree sequences
| 2017-04-24 | Paper |
Shortest paths in nearly conservative digraphs
Parameterized and Exact Computation | 2015-09-15 | Paper |
Randomized and deterministic algorithms for network coding problems in wireless networks
Information Processing Letters | 2015-01-30 | Paper |
scientific article; zbMATH DE number 6382860 (Why is no real title available?)
| 2014-12-30 | Paper |
On the tractability of some natural packing, covering and partitioning problems
Discrete Applied Mathematics | 2014-11-28 | Paper |
Notes on dual-critical graphs
| 2014-10-07 | Paper |
Monochromatic components in edge-colored complete uniform hypergraphs
European Journal of Combinatorics | 2014-07-29 | Paper |
Monochromatic components in edge-colored complete uniform hypergraphs
| 2013-11-01 | Paper |
On the swap-distances of different realizations of a graphical degree sequence
Combinatorics, Probability and Computing | 2013-05-13 | Paper |
On families of weakly cross-intersecting set-pairs
Fundamenta Informaticae | 2012-07-11 | Paper |
Better and simpler approximation algorithms for the stable marriage problem
Algorithmica | 2011-07-01 | Paper |
Induced graph packing problems
Graphs and Combinatorics | 2010-11-12 | Paper |
Local edge-connectivity augmentation in hypergraphs is NP-complete
Discrete Applied Mathematics | 2010-05-05 | Paper |
Better and Simpler Approximation Algorithms for the Stable Marriage Problem
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Recent results on well-balanced orientations
Discrete Optimization | 2008-11-19 | Paper |
An algorithm for node-capacitated ring routing
Operations Research Letters | 2008-01-21 | Paper |
Simultaneous well-balanced orientations of graphs
Journal of Combinatorial Theory. Series B | 2006-08-16 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Packing paths of length at least two
Discrete Mathematics | 2004-08-06 | Paper |
On the orientation of graphs and hypergraphs
Discrete Applied Mathematics | 2003-10-14 | Paper |
An efficient algorithm for global path optimization in MPLS networks
Optimization and Engineering | 2003-03-12 | Paper |
On the combinatorics of projective mappings
Journal of Algebraic Combinatorics | 2002-08-20 | Paper |
Graph orientations with edge-connection and parity constraints
Combinatorica | 2002-06-25 | Paper |
scientific article; zbMATH DE number 1405805 (Why is no real title available?)
| 2000-03-27 | Paper |
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs
SIAM Journal on Discrete Mathematics | 1999-11-23 | Paper |
scientific article; zbMATH DE number 1342130 (Why is no real title available?)
| 1999-09-22 | Paper |
On intersecting hypergraphs
Discrete Mathematics | 1998-12-02 | Paper |
On-line 3-chromatic graphs. II: Critical graphs
Discrete Mathematics | 1998-04-15 | Paper |
