Approximating MIS over equilateral B<sub>1</sub>-VPG graphs.
On Induced Paths, Holes and Trees in Random Graphs.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018
Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs.
SIAM J. Discret. Math., 2016
Maximum Independent Set on B_1 B 1 -VPG Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2015
Probabilistic Arguments in Graph Coloring (Invited Talk).
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015
Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms.
Discuss. Math. Graph Theory, 2014
Forbidden subgraph colorings and the oriented chromatic number.
Eur. J. Comb., 2013
Star coloring subcubic graphs.
Discuss. Math. Graph Theory, 2013
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs.
SIAM J. Discret. Math., 2012
Bounds on vertex colorings with restrictions on the union of color classes.
J. Graph Theory, 2011
Dominating set based exact algorithms for 3-coloring.
Inf. Process. Lett., 2011
On induced acyclic subgraphs in sparse random digraphs.
Electron. Notes Discret. Math., 2011
Oriented colouring of some graph products.
Discuss. Math. Graph Theory, 2011
Bounding χ in terms of ω and Δ for some classes of graphs.
Discret. Math., 2011
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.
Bounds on Edge Colorings with Restrictions on the Union of Color Classes.
SIAM J. Discret. Math., 2010
Optimal acyclic edge colouring of grid like graphs.
Discret. Math., 2010
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
Intersection Dimension and Maximum Degree.
Electron. Notes Discret. Math., 2009
On <i>k</i>-intersection edge colourings.
Discuss. Math. Graph Theory, 2009
On the Size of Induced Acyclic Subgraphs in Random Digraphs.
Discret. Math. Theor. Comput. Sci., 2008
List Set Colouring: Bounds and Algorithms.
Comb. Probab. Comput., 2007
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
Acyclic Edge Colouring of Outerplanar Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2007
Faster fixed parameter tractable algorithms for finding feedback vertex sets.
ACM Trans. Algorithms, 2006
Analysis of a heuristic for acyclic edge colouring.
Inf. Process. Lett., 2006
On Sampling Colorings of Bipartite Graphs.
Discret. Math. Theor. Comput. Sci., 2006
J. Comb. Theory, Ser. B, 2005
Faster algorithms for feedback vertex set.
Electron. Notes Discret. Math., 2005
Improved bounds on acyclic edge colouring.
Electron. Notes Discret. Math., 2005
Graphs of low chordality.
Discret. Math. Theor. Comput. Sci., 2005
A spectral lower bound for the treewidth of a graph and its consequences.
Inf. Process. Lett., 2003
Finding Induced Acyclic Subgraphs in Random Digraphs.
Electron. J. Comb., 2003
Isoperimetric Inequalities and the Width Parameters of Graphs.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
General Partitioning on Random Graphs.
J. Algorithms, 2002
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Paths of specified length in random k-partite graphs.
Discret. Math. Theor. Comput. Sci., 2001
Algorithms For Colouring Random K-Colourable Graphs.
Comb. Probab. Comput., 2000
Coloring Sparse Random Graphs in Polynominal Average Time.
Proceedings of the Algorithms, 2000
Minimum Coloring k-Colorable Graphs in Polynomial Average Time.
J. Algorithms, 1999
A Generalization of Janson Inequalities and its Application to Finding Shortest Paths.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Algorithms for coloring semi-random graphs.
Random Struct. Algorithms, 1998
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998
Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
Improved Algorithms for Coloring Random Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
Coloring Semi-Random Graphs in Polynomial Expected Time.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994
Coloring Random Graphs in Polynomial Expected Time.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
Proceedings of the Algorithm Theory, 1992