| Publication | Date of Publication | Type |
|---|
| Fault-tolerant edge-disjoint \(s\)-\(t\) paths -- beyond uniform faults | 2024-05-27 | Paper |
| Stackelberg packing games | 2023-01-05 | Paper |
| On the Complexity of Stackelberg Matroid Pricing Problems | 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 | 2021-10-20 | Paper |
| How to Secure Matchings against Edge Failures | 2021-10-18 | Paper |
| Erdös--Pósa Property for Labeled Minors: 2-Connected Minors | 2021-05-28 | Paper |
| Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting | 2021-04-23 | Paper |
| Better 3-coloring algorithms: excluding a triangle and a seven vertex path | 2020-12-16 | Paper |
| Improved approximation algorithms for hitting 3-vertex paths | 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 | 2020-02-20 | Paper |
| Stackelberg packing games | 2020-01-16 | Paper |
| Obstructions for three-coloring graphs without induced paths on six vertices | 2020-01-15 | Paper |
| Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable | 2019-10-31 | Paper |
| Approximately coloring graphs without long induced paths | 2019-06-27 | Paper |
| Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles | 2019-06-14 | Paper |
| Three-coloring and list three-coloring of graphs without induced paths on seven vertices | 2018-09-24 | Paper |
| Obstructions for three-coloring graphs with one forbidden induced subgraph | 2018-07-16 | Paper |
| Long cycles through prescribed vertices have the Erdős‐Pósa property | 2018-04-27 | Paper |
| Exhaustive generation of k‐critical ‐free graphs | 2018-02-23 | Paper |
| The parameterized complexity of the equidomination problem | 2018-01-04 | Paper |
| Approximately coloring graphs without long induced paths | 2018-01-04 | Paper |
| On bounding the difference between the maximum degree and the chromatic number by a constant | 2017-09-12 | Paper |
| Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles | 2017-06-23 | Paper |
| Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs | 2016-12-22 | Paper |
| Recognizing k-equistable Graphs in FPT Time | 2016-10-21 | Paper |
| Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles | 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 | 2016-10-12 | Paper |
| A unified approach to recognize squares of split graphs | 2016-09-12 | Paper |
| Improved approximation algorithms for hitting 3-vertex paths | 2016-08-10 | Paper |
| A new characterization of \(P_k\)-free graphs | 2016-06-28 | Paper |
| Structural parameterizations for boxicity | 2016-05-31 | Paper |
| Claw-free \(t\)-perfect graphs can be recognized in polynomial time | 2016-05-09 | Paper |
| The journey of the union-closed sets conjecture | 2015-12-17 | Paper |
| \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs | 2015-10-19 | Paper |
| \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs | 2015-10-16 | Paper |
| Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs | 2015-09-25 | Paper |
| On bounding the difference of the maximum degree and the clique number | 2015-09-24 | Paper |
| Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs | 2015-09-09 | Paper |
| Structural parameterizations for boxicity | 2015-09-09 | Paper |
| A New Characterization of $$P_k$$-free Graphs | 2015-09-09 | Paper |
| The structure of dominating subgraphs | 2014-11-02 | Paper |
| The graph formulation of the union-closed sets conjecture | 2014-10-08 | Paper |
| On disjoint maximal independent sets in graphs | 2014-10-07 | Paper |
| The price of connectivity for dominating set: upper bounds and complexity | 2014-09-08 | Paper |
| A characterization of line graphs that are squares of graphs | 2014-08-22 | Paper |
| The graph formulation of the union-closed sets conjecture | 2014-06-11 | 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 | 2014-06-02 | Paper |
| The Price of Connectivity for Vertex Cover | 2014-05-02 | Paper |
| Computing square roots of trivially perfect and threshold graphs | 2014-04-16 | Paper |
| On dominating sets whose induced subgraphs have a bounded diameter | 2014-04-10 | Paper |
| The complexity of connected dominating sets and total dominating sets with specified induced subgraphs | 2013-03-21 | Paper |
| On the separability of graphs | 2013-03-19 | Paper |
| Total domination versus paired domination | 2012-11-16 | Paper |
| Paired- and induced paired-domination in (E,net)-free graphs | 2012-11-16 | Paper |
| Efficient total domination in digraphs | 2012-09-13 | Paper |
| On graphs for which the connected domination number is at most the total domination number | 2012-05-30 | Paper |
| A note on connected dominating sets of distance-hereditary graphs | 2012-05-30 | Paper |
| On weighted efficient total domination | 2012-05-11 | Paper |
| On the existence of total dominating subgraphs with a prescribed additive hereditary property | 2011-10-21 | Paper |
| Minimal obstructions to $C_5$-coloring in hereditary graph classes | N/A | Paper |
