| Publication | Date of Publication | Type |
|---|
| Improved bounds for covering hypergraphs | 2022-08-26 | Paper |
Randomized memoryless algorithms for the weighted and the generalized \(k\)-server problems
ACM Transactions on Algorithms | 2021-12-16 | Paper |
Multicovering hypergraphs
Discrete Mathematics | 2021-04-28 | Paper |
| A coding perspective on the lower bound for diagonal Ramsey numbers | 2021-04-27 | Paper |
Maximum matching on trees in the online preemptive and the incremental graph models
Algorithmica | 2019-10-17 | Paper |
Bounds for the Graham-Pollak theorem for hypergraphs
Discrete Mathematics | 2019-09-11 | Paper |
Random walks, electric networks and the transience class problem of sandpiles
(available as arXiv preprint) | 2019-05-10 | Paper |
| Random walks, electric networks and the transience class problem of sandpiles | 2019-05-10 | Paper |
On hard instances of approximate vertex cover
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On the approximability of the minimum rainbow subgraph problem and other related problems
Algorithmica | 2017-11-09 | Paper |
Maximum matching on trees in the online preemptive and the incremental dynamic graph models
(available as arXiv preprint) | 2017-10-23 | Paper |
Approximating the regular graphic TSP in near linear time
(available as arXiv preprint) | 2017-07-13 | Paper |
On the approximability of the minimum rainbow subgraph problem and other related problems
Algorithms and Computation | 2016-01-11 | Paper |
On randomized algorithms for matching in the online preemptive model
Algorithms - ESA 2015 | 2015-11-19 | Paper |
| scientific article; zbMATH DE number 6472632 (Why is no real title available?) | 2015-08-14 | Paper |
Locality based graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
On graph parameters guaranteeing fast sandpile diffusion
The Electronic Journal of Combinatorics | 2015-03-11 | Paper |
On graph parameters guaranteeing fast sandpile diffusion
The Electronic Journal of Combinatorics | 2015-03-11 | Paper |
Metrical service systems with multiple servers
Algorithmica | 2015-03-02 | Paper |
Circumference, chromatic number and online coloring
Combinatorica | 2014-03-17 | Paper |
Metrical service systems with multiple servers
Lecture Notes in Computer Science | 2013-06-11 | Paper |
A counting proof of the Graham-Pollak theorem
Discrete Mathematics | 2013-03-19 | Paper |
| Improved bounds on the sandpile diffusions on Grid graphs | 2012-10-16 | Paper |
Approximation algorithms for the Bipartite Multicut problem
Information Processing Letters | 2010-09-07 | Paper |
Bipartite coverings and the chromatic number
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Bipartite coverings and the chromatic number
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Bipartite coverings and the chromatic number
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
The common prefix problem on trees
Information Processing Letters | 2010-03-24 | Paper |
Matched-Factor d-Domatic Coloring of Graphs
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
A polynomial space proof of the Graham-Pollak theorem
Journal of Combinatorial Theory. Series A | 2008-05-13 | Paper |
A bound on the chromatic number using the longest odd cycle length
Journal of Graph Theory | 2007-05-11 | Paper |
Some results in square-free and strong square-free edge-colorings of graphs
Discrete Mathematics | 2007-05-11 | Paper |
A technique for multicoloring triangle-free hexagonal graphs
Discrete Mathematics | 2005-10-26 | Paper |
An approximation algorithm for finding long paths in Hamiltonian graphs
Journal of Algorithms | 2004-10-01 | Paper |
| Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem | 2004-08-04 | Paper |
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
(available as arXiv preprint) | 2004-08-04 | Paper |
On 2-coloring certain \(k\)-uniform hypergraphs
Journal of Combinatorial Theory. Series A | 2003-03-26 | Paper |
Approximation algorithms for the achromatic number.
Journal of Algorithms | 2002-07-08 | Paper |
| scientific article; zbMATH DE number 1445365 (Why is no real title available?) | 2001-03-12 | Paper |
Multilinear polynomials and a conjecture of Frankl and Füredi
Journal of Combinatorial Theory. Series A | 1999-07-07 | Paper |
AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
Journal of Algorithms | 1998-12-02 | Paper |
| scientific article; zbMATH DE number 871893 (Why is no real title available?) | 1996-11-26 | Paper |
Constructing Reliable Communication Networks of Small Weight Online
Journal of Algorithms | 1995-04-09 | Paper |
An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
Information Processing Letters | 1993-05-16 | Paper |
Randomized online graph coloring
Journal of Algorithms | 1993-01-12 | Paper |
WITHDRAWN: On the Mod-6 Town Rules
(available as arXiv preprint) | N/A | Paper |
