| Publication | Date of Publication | Type |
|---|
Distributed approximation for \(f\)-matching
Theoretical Computer Science | 2024-10-07 | Paper |
| scientific article; zbMATH DE number 7788632 (Why is no real title available?) | 2024-01-15 | Paper |
| Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs | 2022-07-21 | Paper |
Distributed distance domination in graphs with no \(K_{2,t}\)-minor
Theoretical Computer Science | 2022-05-31 | Paper |
On even rainbow or nontriangular directed cycles
Journal of Combinatorics | 2022-02-03 | Paper |
On odd rainbow cycles in edge-colored graphs
European Journal of Combinatorics | 2021-04-14 | Paper |
Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
Theoretical Computer Science | 2020-01-29 | Paper |
Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs
SIAM Journal on Discrete Mathematics | 2019-10-28 | Paper |
Optimal pebbling number of graphs with given minimum degree
Discrete Applied Mathematics | 2019-05-03 | Paper |
Optimal pebbling number of graphs with given minimum degree
Discrete Applied Mathematics | 2019-05-03 | Paper |
Tiling directed graphs with tournaments
Forum of Mathematics, Sigma | 2019-03-12 | Paper |
Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs
Theoretical Computer Science | 2019-01-18 | Paper |
| Even cycles in dense graphs | 2018-06-25 | Paper |
| Balanced Spanning Caterpillars | 2017-11-29 | Paper |
An extension of the Hajnal-Szemerédi theorem to directed graphs
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
Theoretical Computer Science | 2017-01-09 | Paper |
Tight co-degree condition for packing of loose cycles in 3-graphs
Journal of Graph Theory | 2016-11-17 | Paper |
On the distributed complexity of the semi-matching problem
Journal of Computer and System Sciences | 2016-08-04 | Paper |
On directed versions of the Corrádi-Hajnal corollary
European Journal of Combinatorics | 2014-09-04 | Paper |
Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Tiling 3-uniform hypergraphs with \(K_4^3-2e\)
Journal of Graph Theory | 2014-01-28 | Paper |
| Tiling in bipartite graphs with asymmetric minimum degrees | 2013-10-01 | Paper |
Distributed 2-approximation algorithm for the semi-matching problem
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Tight co-degree condition for perfect matchings in 4-graphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
A note on bipartite graph tiling
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Brief announcement: Distributed approximations for the semi-matching problem
Lecture Notes in Computer Science | 2011-10-28 | Paper |
On random sampling in uniform hypergraphs
Random Structures & Algorithms | 2011-08-09 | Paper |
2-factors of bipartite graphs with asymmetric minimum degrees
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Distributed Algorithm for Better Approximation of the Maximum Matching
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs
Algorithms and Computation | 2009-12-17 | Paper |
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Fast Distributed Approximations in Planar Graphs
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Distributed Approximation Algorithms in Unit-Disk Graphs
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Distributed Approximations for Packing in Unit-Disk Graphs
Lecture Notes in Computer Science | 2008-09-02 | Paper |
On the pebbling threshold of paths and the pebbling threshold spectrum
Discrete Mathematics | 2008-07-11 | Paper |
Distributed Almost Exact Approximations for Minor-Closed Families
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Distributed Approximation Algorithms for Planar Graphs
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Distributed algorithms for weighted problems in sparse graphs
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Girth, Pebbling, and Grid Thresholds
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Distributed algorithm for approximating the maximum matching
Discrete Applied Mathematics | 2004-11-23 | Paper |
Strong edge colorings of uniform graphs
Discrete Mathematics | 2004-11-22 | Paper |
Bounding the strong chromatic index of dense random graphs
Discrete Mathematics | 2004-08-06 | Paper |
Matrix-free proof of a regularity characterization
The Electronic Journal of Combinatorics | 2004-02-05 | Paper |
Matrix-free proof of a regularity characterization
The Electronic Journal of Combinatorics | 2004-02-05 | Paper |
Thresholds for families of multisets, with an application to graph pebbling
Discrete Mathematics | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1875427 (Why is no real title available?) | 2003-03-02 | Paper |
scientific article; zbMATH DE number 1998296 (Why is no real title available?)
(available as arXiv preprint) | 2003-01-01 | Paper |
2-factors in dense bipartite graphs
Discrete Mathematics | 2002-12-02 | Paper |
A note on graph pebbling
Graphs and Combinatorics | 2002-07-29 | Paper |
Partitioning problems in dense hypergraphs
Discrete Applied Mathematics | 2002-06-19 | Paper |
On pebbling threshold functions for graph sequences
Discrete Mathematics | 2002-05-28 | Paper |
Spanning trees of bounded degree
The Electronic Journal of Combinatorics | 2001-12-11 | Paper |
Spanning trees of bounded degree
The Electronic Journal of Combinatorics | 2001-12-11 | Paper |
A note on codegree problems for hypergraphs
Bulletin of the Institute of Combinatorics and its Applications | 2001-10-21 | Paper |
Maximum dispersion problem in dense graphs
Operations Research Letters | 2001-01-01 | Paper |
An Algorithmic Regularity Lemma for Hypergraphs
SIAM Journal on Computing | 2000-10-18 | Paper |
Constructive Quasi-Ramsey Numbers and Tournament Ranking
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
