| Publication | Date of Publication | Type |
|---|
Fault-tolerant edge-disjoint \(s\)-\(t\) paths -- beyond uniform faults
| 2024-05-27 | Paper |
Stackelberg packing games
Theoretical Computer Science | 2023-01-05 | Paper |
On the Complexity of Stackelberg Matroid Pricing Problems
Lecture Notes in Computer Science | 2022-10-13 | Paper |
How to Secure Matchings Against Edge Failures
| 2022-07-18 | Paper |
Discrete optimization methods for group model selection in compressed sensing
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
How to Secure Matchings against Edge Failures
SIAM Journal on Discrete Mathematics | 2021-10-18 | Paper |
Erdős-Pósa property for labeled minors: 2-connected minors
SIAM Journal on Discrete Mathematics | 2021-05-28 | Paper |
Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
Mathematical Programming. Series A. Series B | 2021-04-23 | Paper |
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
Theoretical Computer Science | 2020-12-16 | Paper |
Improved approximation algorithms for hitting 3-vertex paths
Mathematical Programming. Series A. Series B | 2020-06-26 | Paper |
Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
| 2020-05-27 | Paper |
Obstructions for three-coloring and list three-coloring \(H\)-free graphs
SIAM Journal on Discrete Mathematics | 2020-02-20 | Paper |
Stackelberg packing games
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Obstructions for three-coloring graphs without induced paths on six vertices
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Triangle-free graphs that do not contain an induced subdivision of \(K_4\) are 3-colorable
Journal of Graph Theory | 2019-10-31 | Paper |
Approximately coloring graphs without long induced paths
Algorithmica | 2019-06-27 | Paper |
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
Journal of Graph Theory | 2019-06-14 | Paper |
Three-coloring and list three-coloring of graphs without induced paths on seven vertices
Combinatorica | 2018-09-24 | Paper |
Obstructions for three-coloring graphs with one forbidden induced subgraph
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Long cycles through prescribed vertices have the Erdős-Pósa property
Journal of Graph Theory | 2018-04-27 | Paper |
Exhaustive generation of \(k\)-critical \(\mathcal{H}\)-free graphs
Journal of Graph Theory | 2018-02-23 | Paper |
The parameterized complexity of the equidomination problem
| 2018-01-04 | Paper |
Approximately coloring graphs without long induced paths
Lecture Notes in Computer Science | 2018-01-04 | Paper |
On bounding the difference between the maximum degree and the chromatic number by a constant
Discrete Applied Mathematics | 2017-09-12 | Paper |
Almost partitioning a 3-edge-colored \(K_{n,n}\) into five monochromatic cycles
SIAM Journal on Discrete Mathematics | 2017-06-23 | Paper |
Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Recognizing \(k\)-equistable graphs in FPT time
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
| 2016-10-14 | Paper |
The union-closed sets conjecture almost holds for almost all random bipartite graphs
European Journal of Combinatorics | 2016-10-12 | Paper |
A unified approach to recognize squares of split graphs
Theoretical Computer Science | 2016-09-12 | Paper |
Improved approximation algorithms for hitting 3-vertex paths
Lecture Notes in Computer Science | 2016-08-10 | Paper |
A new characterization of \(P_k\)-free graphs
Algorithmica | 2016-06-28 | Paper |
Structural parameterizations for boxicity
Algorithmica | 2016-05-31 | Paper |
Claw-free \(t\)-perfect graphs can be recognized in polynomial time
SIAM Journal on Discrete Mathematics | 2016-05-09 | Paper |
The journey of the union-closed sets conjecture
Graphs and Combinatorics | 2015-12-17 | Paper |
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
Algorithmica | 2015-10-19 | Paper |
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
Theoretical Computer Science | 2015-09-25 | Paper |
On bounding the difference of the maximum degree and the clique number
Graphs and Combinatorics | 2015-09-24 | Paper |
A New Characterization of $$P_k$$-free Graphs
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Structural parameterizations for boxicity
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
Lecture Notes in Computer Science | 2015-09-09 | Paper |
The structure of dominating subgraphs
| 2014-11-02 | Paper |
The graph formulation of the union-closed sets conjecture
European Journal of Combinatorics | 2014-10-08 | Paper |
On disjoint maximal independent sets in graphs
Information Processing Letters | 2014-10-07 | Paper |
The price of connectivity for dominating set: upper bounds and complexity
Discrete Applied Mathematics | 2014-09-08 | Paper |
A characterization of line graphs that are squares of graphs
Discrete Applied Mathematics | 2014-08-22 | Paper |
The union-closed sets conjecture almost holds for almost all random bipartite graphs
| 2014-06-11 | Paper |
Claw-free \(t\)-perfect graphs can be recognised in polynomial time
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
The price of connectivity for vertex cover
| 2014-05-02 | Paper |
Computing square roots of trivially perfect and threshold graphs
Discrete Applied Mathematics | 2014-04-16 | Paper |
On dominating sets whose induced subgraphs have a bounded diameter
Discrete Applied Mathematics | 2014-04-10 | Paper |
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
Information Processing Letters | 2013-03-21 | Paper |
On the separability of graphs
Discrete Mathematics | 2013-03-19 | Paper |
Total domination versus paired domination
Discussiones Mathematicae Graph Theory | 2012-11-16 | Paper |
Paired- and induced paired-domination in \(\{E, net\}\)
Discussiones Mathematicae Graph Theory | 2012-11-16 | Paper |
Efficient total domination in digraphs
Journal of Discrete Algorithms | 2012-09-13 | Paper |
On graphs for which the connected domination number is at most the total domination number
Discrete Applied Mathematics | 2012-05-30 | Paper |
A note on connected dominating sets of distance-hereditary graphs
Discrete Applied Mathematics | 2012-05-30 | Paper |
On weighted efficient total domination
Journal of Discrete Algorithms | 2012-05-11 | Paper |
On the existence of total dominating subgraphs with a prescribed additive hereditary property
Discrete Mathematics | 2011-10-21 | Paper |
Minimal obstructions to $C_5$-coloring in hereditary graph classes
| N/A | Paper |
