| Publication | Date of Publication | Type |
|---|
Constrained flows in networks
Theoretical Computer Science | 2024-08-20 | Paper |
Kernelization for graph packing problems via rainbow matching
| 2024-05-14 | Paper |
FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs
Discrete Applied Mathematics | 2024-02-14 | Paper |
Complementary cycles of any length in regular bipartite tournaments
Journal of Graph Theory | 2023-10-12 | Paper |
Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
Journal of Graph Theory | 2023-10-05 | Paper |
Constrained Flows in Networks
| 2023-10-02 | Paper |
Good orientations of unions of edge‐disjoint spanning trees
Journal of Graph Theory | 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
The Electronic Journal of Combinatorics | 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
Graphs and Combinatorics | 2022-11-29 | Paper |
Complexity of some arc-partition problems for digraphs
Theoretical Computer Science | 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
The Electronic Journal of Combinatorics | 2022-07-11 | Paper |
Algorithmic aspects of broadcast independence
Discrete Applied Mathematics | 2022-04-20 | Paper |
Unbalanced spanning subgraphs in edge labeled complete graphs
| 2021-07-20 | Paper |
Exponential independence in subcubic graphs
Discrete Mathematics | 2021-06-14 | Paper |
Packing arc-disjoint cycles in tournaments
Algorithmica | 2021-04-19 | Paper |
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
Discrete Applied Mathematics | 2020-07-07 | Paper |
Triangle packing in (sparse) tournaments: approximation and kernelization
| 2020-05-27 | Paper |
Out-colourings of digraphs
Journal of Graph Theory | 2020-05-21 | Paper |
Maximal Wiener index for graphs with prescribed number of blocks
Applied Mathematics and Computation | 2020-05-14 | Paper |
On independent set in \(B_1\)-EPG graphs
Discrete Applied Mathematics | 2020-04-21 | Paper |
The structure of graphs with given number of blocks and the maximum Wiener index
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
Parameterized complexity of a coupled-task scheduling problem
Journal of Scheduling | 2019-12-30 | Paper |
Girth, minimum degree, independence, and broadcast independence
| 2019-11-08 | Paper |
Bipartite spanning sub(di)graphs induced by 2-partitions
Journal of Graph Theory | 2019-10-31 | Paper |
Relating broadcast independence and independence
Discrete Mathematics | 2019-10-17 | Paper |
On the Kőnig‐Egerváry theorem for ‐paths
Journal of Graph Theory | 2019-06-14 | Paper |
Degree-constrained 2-partitions of graphs
Theoretical Computer Science | 2019-05-29 | Paper |
Dynamic monopolies for interval graphs with bounded thresholds
Discrete Applied Mathematics | 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
Theoretical Computer Science | 2018-03-12 | Paper |
The geodetic hull number is hard for chordal graphs
SIAM Journal on Discrete Mathematics | 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
Discrete Applied Mathematics | 2017-12-06 | Paper |
Burning a graph is hard
Discrete Applied Mathematics | 2017-10-17 | Paper |
Extremal values of the chromatic number for a given degree sequence
Graphs and Combinatorics | 2017-10-11 | Paper |
Colorful paths for 3-chromatic graphs
Discrete Mathematics | 2017-02-27 | Paper |
Exponential domination in subcubic graphs
The Electronic Journal of Combinatorics | 2017-01-18 | Paper |
Bounds on the exponential domination number
Discrete Mathematics | 2016-12-22 | Paper |
Antistrong digraphs
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
On independent set on B1-EPG graphs
Approximation and Online Algorithms | 2016-02-26 | Paper |
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
Journal of Graph Theory | 2015-07-23 | Paper |
Two-floor buildings need eight colors
Journal of Graph Algorithms and Applications | 2015-01-27 | Paper |
Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
Journal of Graph Theory | 2014-05-22 | Paper |
(Arc-)disjoint flows in networks
Theoretical Computer Science | 2014-03-13 | Paper |
Polynomial kernels for proper interval completion and related problems
Information and Computation | 2014-01-16 | Paper |
Enumerating the edge-colourings and total colourings of a regular graph
Journal of Combinatorial Optimization | 2013-06-13 | Paper |
Kernels for feedback arc set in tournaments
| 2012-10-24 | Paper |
Kernels for feedback arc set in tournaments
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Polynomial kernels for proper interval completion and related problems
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Optical index of fault tolerant routings in WDM networks
Networks | 2010-11-24 | Paper |
Polynomial kernels for 3-leaf power graph modification problems
Discrete Applied Mathematics | 2010-11-05 | Paper |
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
Discrete Mathematics | 2010-03-29 | Paper |
Polynomial kernels for 3-leaf power graph modification problems
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
Combinatorica | 2008-10-21 | Paper |
Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
Discrete Mathematics | 2008-09-04 | Paper |
Two proofs of Bermond-Thomassen conjecture for regular tournaments
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
Journal of Graph Theory | 2007-02-02 | Paper |
The categorical product of two 5-chromatic digraphs can be 3-chromatic
Discrete Mathematics | 2006-01-10 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Temporalizing digraphs via linear-size balanced bi-trees
| N/A | Paper |
Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture
| N/A | Paper |
