| Publication | Date of Publication | Type |
|---|
A geometric programming approach to solve the restricted assignment case of the Santa Claus problem
Theory of Computing Systems | 2026-01-02 | Paper |
| Succinct data structure for chordal graphs with bounded vertex leafage | 2025-12-02 | Paper |
| A faster algorithm for vertex cover parameterized by solution size | 2025-11-10 | Paper |
Perfect resolution of strong conflict-free colouring of interval hypergraphs
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Parameterized algorithms for the Steiner arborescence problem on a hypercube
Acta Informatica | 2025-01-10 | Paper |
Exactly hittable interval graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
Succinct data structure for path graphs
Information and Computation | 2024-01-18 | Paper |
Parameterized complexity of minimum membership dominating set
Algorithmica | 2023-11-17 | Paper |
scientific article; zbMATH DE number 7724205 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
Trade-offs in dynamic coloring for bipartite and general graphs
Algorithmica | 2023-04-11 | Paper |
| Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs | 2023-02-07 | Paper |
Parameterized complexity of minimum membership dominating set
(available as arXiv preprint) | 2022-07-13 | Paper |
The connected domination number of grids
(available as arXiv preprint) | 2022-03-24 | Paper |
The Connected Domination Number of Grids
(available as arXiv preprint) | 2020-11-23 | Paper |
Lazy or eager dynamic matching may not be fast
Information Processing Letters | 2020-10-07 | Paper |
Dynamic data structures for interval coloring
Theoretical Computer Science | 2020-09-01 | Paper |
| Exact algorithms for allocation problems | 2020-07-07 | Paper |
| Data structures for incremental interval coloring | 2020-02-24 | Paper |
On the complexity landscape of connected \(f\)-factor problems
Algorithmica | 2019-05-17 | Paper |
| Facility location on planar graphs with unreliable links | 2018-11-28 | Paper |
Faster parameterized algorithms using linear programming
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Minimum membership hitting sets of axis parallel segments | 2018-10-04 | Paper |
Approximability of clique transversal in perfect graphs
Algorithmica | 2018-07-25 | Paper |
Approximation algorithms for connected graph factors of minimum weight
Theory of Computing Systems | 2018-04-12 | Paper |
On the complexity landscape of connected \(f\)-factor problems
(available as arXiv preprint) | 2018-03-21 | Paper |
Hitting Set for hypergraphs of low VC-dimension
(available as arXiv preprint) | 2018-03-02 | Paper |
| Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs | 2017-07-17 | Paper |
A refined analysis of online path coloring in trees
Approximation and Online Algorithms | 2017-04-04 | Paper |
Connected (s,t)-vertex separator parameterized by chordality
Journal of Graph Algorithms and Applications | 2015-11-25 | Paper |
Approximation and exact algorithms for special cases of connected f-factors
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Tree \(t\)-spanners in outerplanar graphs via supply demand partition
Discrete Applied Mathematics | 2015-09-21 | Paper |
Block Sorting Is APX-Hard
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Characterization of minimum cycle basis in weighted partial 2-trees
Discrete Applied Mathematics | 2015-08-18 | Paper |
Obtaining matrices with the consecutive ones property by row deletions
Algorithmica | 2015-05-04 | Paper |
On minimum average stretch spanning trees in polygonal 2-trees
Theoretical Computer Science | 2015-04-01 | Paper |
Approximate distance oracle in \(O(n ^{2})\) time and \(O(n)\) space for chordal graphs
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Tree path labeling of hypergraphs -- a generalization of the consecutive ones property
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Approximability of connected factors
Approximation and Online Algorithms | 2014-09-02 | Paper |
Another disjoint compression algorithm for odd cycle transversal
Information Processing Letters | 2014-04-14 | Paper |
On minimum average stretch spanning trees in polygonal 2-trees
Algorithms and Computation | 2014-02-18 | Paper |
A Dirac-type characterization of \(k\)-chordal graphs
Discrete Mathematics | 2014-01-27 | Paper |
Solving min ones 2-SAT as fast as vertex cover
Theoretical Computer Science | 2014-01-16 | Paper |
FPT algorithms for consecutive ones submatrix problems
Parameterized and Exact Computation | 2013-12-10 | Paper |
A unified framework for bi(tri)connectivity and chordal augmentation
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
On the structure of contractible vertex pairs in chordal graphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Dominating set based exact algorithms for 3-coloring
Information Processing Letters | 2013-04-04 | Paper |
Parameterized algorithms for (r,l)-partization
Journal of Graph Algorithms and Applications | 2013-03-19 | Paper |
| LP can be a cure for parameterized problems | 2012-08-23 | Paper |
Generalized above guarantee vertex cover and r-partization
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Hardness of subgraph and supergraph problems in c-tournaments
Theoretical Computer Science | 2011-09-12 | Paper |
| On the arrangement of cliques in chordal graphs with respect to the cuts | 2011-06-29 | Paper |
A polynomial time algorithm for longest paths in biconvex graphs
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Solving \textsc{minones-2-sat} as fast as \textsc{vertex cover}
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
A new characterization of matrices with the consecutive ones property
Discrete Applied Mathematics | 2010-04-28 | Paper |
A note on the Hadwiger number of circular arc graphs
Information Processing Letters | 2010-03-24 | Paper |
On the structure of contractible edges in \(k\)-connected partial \(k\)-trees
Graphs and Combinatorics | 2010-01-18 | Paper |
A note on first-fit coloring of interval graphs
Order | 2008-06-03 | Paper |
Sequences Characterizing k-Trees
Lecture Notes in Computer Science | 2007-09-10 | Paper |
An improved algorithm for online coloring of intervals with bandwidth
Theoretical Computer Science | 2007-01-09 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
| scientific article; zbMATH DE number 2086392 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1929954 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1796977 (Why is no real title available?) | 2002-09-05 | Paper |
A faster algorithm for Vertex Cover parameterized by solution size
(available as arXiv preprint) | N/A | Paper |
