| Publication | Date of Publication | Type |
|---|
New Menger-like dualities in digraphs and applications to half-integral linkages
ACM Transactions on Algorithms | 2025-10-01 | Paper |
| New Menger-like dualities in digraphs and applications to half-integral linkages | 2025-01-06 | Paper |
| Deciding the Erdős-Pósa Property in 3-Connected Digraphs | 2024-05-03 | Paper |
| A new framework for kernelization lower bounds: the case of maximum minimal vertex cover | 2024-02-12 | Paper |
On the hull number on cycle convexity of graphs
Information Processing Letters | 2023-10-12 | Paper |
| New Menger-like dualities in digraphs and applications to half-integral linkages | 2023-06-28 | Paper |
Parameterized complexity of computing maximum minimal blocking and hitting sets
Algorithmica | 2023-02-16 | Paper |
Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
Algorithmica | 2022-10-27 | Paper |
Adapting the directed grid theorem into an FPT algorithm
SIAM Journal on Discrete Mathematics | 2022-08-31 | Paper |
| Adapting the directed grid theorem into an \textsf{FPT} algorithm | 2022-04-27 | Paper |
| Cycle convexity and the tunnel number of links | 2020-12-10 | Paper |
On the complexity of finding internally vertex-disjoint long directed paths
Algorithmica | 2020-04-14 | Paper |
On the complexity of finding internally vertex-disjoint long directed paths
Lecture Notes in Computer Science | 2020-02-12 | Paper |
| Complexity of determining the maximum infection time in the geodetic convexity | 2016-10-17 | Paper |
A proof for a conjecture of Gorgol
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
A polyhedral study of the maximum stable set problem with weights on vertex-subsets
Discrete Applied Mathematics | 2016-06-22 | Paper |
| Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation | 2015-08-28 | Paper |
Maximization coloring problems on graphs with few \(P_4\)
Discrete Applied Mathematics | 2014-05-05 | Paper |
Backbone colouring: tree backbones with small diameter in planar graphs
Theoretical Computer Science | 2013-12-11 | Paper |
Restricted coloring problems on graphs with few \(P'_4s\)
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
\(B\)-chromatic number of cacti
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
On the hull number of some graph classes
Theoretical Computer Science | 2013-03-04 | Paper |
New bounds on the Grundy number of products of graphs
Journal of Graph Theory | 2012-09-12 | Paper |
| 5-choosability of graphs with 2 crossings | 2011-05-13 | Paper |
On the asymmetric representatives formulation for the vertex coloring problem
Discrete Applied Mathematics | 2008-04-16 | Paper |
| scientific article; zbMATH DE number 5158521 (Why is no real title available?) | 2007-05-29 | Paper |
