| Publication | Date of Publication | Type |
|---|
| FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs | 2024-02-14 | Paper |
| Complementary cycles of any length in regular bipartite tournaments | 2023-10-12 | Paper |
| Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 | 2023-10-05 | Paper |
| Constrained Flows in Networks | 2023-10-02 | Paper |
| Good orientations of unions of edge‐disjoint spanning trees | 2023-09-29 | Paper |
| Dichromatic number of chordal graphs | 2023-09-29 | Paper |
| Sparse vertex cutsets and the maximum degree | 2023-04-20 | Paper |
| Unbalanced spanning subgraphs in edge labeled complete graphs | 2023-03-21 | Paper |
| Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. | 2023-02-03 | Paper |
| Non-separating spanning trees and out-branchings in digraphs of independence number 2 | 2022-11-29 | Paper |
| Complexity of some arc-partition problems for digraphs | 2022-10-07 | Paper |
| Packing Arc-Disjoint Cycles in Tournaments | 2022-07-21 | Paper |
| Factorially many maximum matchings close to the Erdős-Gallai bound | 2022-07-11 | Paper |
| Algorithmic aspects of broadcast independence | 2022-04-20 | Paper |
| Unbalanced spanning subgraphs in edge labeled complete graphs | 2021-07-20 | Paper |
| Exponential independence in subcubic graphs | 2021-06-14 | Paper |
| Packing arc-disjoint cycles in tournaments | 2021-04-19 | Paper |
| Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs | 2020-07-07 | Paper |
| Triangle packing in (sparse) tournaments: approximation and kernelization | 2020-05-27 | Paper |
| Out‐colourings of digraphs | 2020-05-21 | Paper |
| Maximal Wiener index for graphs with prescribed number of blocks | 2020-05-14 | Paper |
| On independent set in \(B_1\)-EPG graphs | 2020-04-21 | Paper |
| The structure of graphs with given number of blocks and the maximum Wiener index | 2020-02-03 | Paper |
| Parameterized complexity of a coupled-task scheduling problem | 2019-12-30 | Paper |
| Girth, minimum degree, independence, and broadcast independence | 2019-11-08 | Paper |
| Bipartite spanning sub(di)graphs induced by 2‐partitions | 2019-10-31 | Paper |
| Relating broadcast independence and independence | 2019-10-17 | Paper |
| On the Kőnig‐Egerváry theorem for ‐paths | 2019-06-14 | Paper |
| Degree-constrained 2-partitions of graphs | 2019-05-29 | Paper |
| Dynamic monopolies for interval graphs with bounded thresholds | 2019-05-03 | Paper |
| Good orientations of 2T-graphs | 2019-03-25 | Paper |
| The geodetic hull number is hard for chordal graphs | 2018-04-09 | Paper |
| Out-degree reducing partitions of digraphs | 2018-03-12 | Paper |
| The Geodetic Hull Number is Hard for Chordal Graphs | 2018-03-05 | Paper |
| (Arc-disjoint) cycle packing in tournament: classical and parameterized complexity | 2018-02-19 | Paper |
| Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture | 2018-01-18 | Paper |
| Bounds on the burning number | 2017-12-06 | Paper |
| Burning a graph is hard | 2017-10-17 | Paper |
| Extremal values of the chromatic number for a given degree sequence | 2017-10-11 | Paper |
| Colorful paths for 3-chromatic graphs | 2017-02-27 | Paper |
| Exponential domination in subcubic graphs | 2017-01-18 | Paper |
| Bounds on the exponential domination number | 2016-12-22 | Paper |
| Antistrong digraphs | 2016-11-25 | Paper |
| On Independent Set on B1-EPG Graphs | 2016-02-26 | Paper |
| Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles | 2015-07-23 | Paper |
| Two-floor buildings need eight colors | 2015-01-27 | Paper |
| Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments | 2014-05-22 | Paper |
| (Arc-)disjoint flows in networks | 2014-03-13 | Paper |
| Polynomial kernels for proper interval completion and related problems | 2014-01-16 | Paper |
| Enumerating the edge-colourings and total colourings of a regular graph | 2013-06-13 | Paper |
| Kernels for Feedback Arc Set In Tournaments | 2012-10-24 | Paper |
| Kernels for feedback arc set in tournaments | 2012-01-11 | Paper |
| Polynomial Kernels for Proper Interval Completion and Related Problems | 2011-08-19 | Paper |
| Optical index of fault tolerant routings in WDM networks | 2010-11-24 | Paper |
| Polynomial kernels for 3-leaf power graph modification problems | 2010-11-05 | Paper |
| Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture | 2010-04-21 | Paper |
| Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree | 2010-03-29 | Paper |
| Polynomial Kernels for 3-Leaf Power Graph Modification Problems | 2009-12-11 | Paper |
| Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture | 2008-10-21 | Paper |
| Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach | 2008-09-04 | Paper |
| Two proofs of Bermond-Thomassen conjecture for regular tournaments | 2007-05-29 | Paper |
| Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree | 2007-02-02 | Paper |
| The categorical product of two 5-chromatic digraphs can be 3-chromatic | 2006-01-10 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs | 2003-08-25 | Paper |
