| Publication | Date of Publication | Type |
|---|
Five edge-independent spanning trees
Procedia Computer Science | 2025-12-11 | Paper |
Obstructions for -diperfectness
Procedia Computer Science | 2025-12-11 | Paper |
Preface [Proceedings of the XI Latin and American algorithms, graphs and optimization symposium]
Procedia Computer Science | 2025-12-02 | Paper |
BE-diperfect digraphs with stability number two
The Electronic Journal of Combinatorics | 2024-07-18 | Paper |
Some results on structure of arbitrary arc-locally (out) in-semicomplete digraphs
Journal of Combinatorics | 2023-11-15 | Paper |
On -diperfect digraphs with stability number two
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
A family of counterexamples for a conjecture of Berge on \(\alpha\)-diperfect digraphs
Discrete Mathematics | 2023-05-31 | Paper |
Some results on Berge's conjecture and begin-end conjecture
Graphs and Combinatorics | 2022-06-17 | Paper |
\( \chi \)-diperfect digraphs
Discrete Mathematics | 2022-06-14 | Paper |
| On edge-magic labelings of forests | 2022-04-27 | Paper |
| Linial's conjecture for arc-spine digraphs | 2022-04-27 | Paper |
\(\alpha\)-diperfect digraphs
Discrete Mathematics | 2022-03-14 | Paper |
| $3$-anti-circulant digraphs are $\alpha$-diperfect and BE-diperfect | 2022-03-09 | Paper |
Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\)
Graphs and Combinatorics | 2021-11-30 | Paper |
Group parking permit problems
Discrete Applied Mathematics | 2020-05-29 | Paper |
Gallai's path decomposition conjecture for graphs with treewidth at most 3
Journal of Graph Theory | 2020-05-21 | Paper |
| Two novel results on the existence of 3-kernels in digraphs | 2019-12-22 | Paper |
Graphs with at most one crossing
Discrete Mathematics | 2019-09-11 | Paper |
Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
Graphs and Combinatorics | 2019-06-28 | Paper |
| Advances in Aharoni-Hartman-Hoffman's conjecture for split digraphs | 2018-04-09 | Paper |
| A 3-approximation algorithm for the maximum leaf \(k\)-forest problem | 2018-04-09 | Paper |
| On generalizations of the parking permit problem and network leasing problems | 2018-04-09 | Paper |
| Edge-magic labelings for constellations and armies of caterpillars | 2017-08-15 | Paper |
On Linial's conjecture for spine digraphs
Discrete Mathematics | 2017-02-27 | Paper |
A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
Algorithmica | 2016-12-21 | Paper |
| The online prize-collecting facility location problem | 2016-10-17 | Paper |
| Flow-based formulation for the maximum leaf spanning tree problem | 2016-10-17 | Paper |
Stronger bounds and faster algorithms for packing in generalized kernel systems
Mathematical Programming. Series A. Series B | 2016-09-16 | Paper |
| A note on the paper ``Eternal security in graphs'' by Goddard, Hedetniemi, and Hedetniemi (2005) | 2016-07-20 | Paper |
Spanning trees with nonseparating paths
Discrete Mathematics | 2015-10-08 | Paper |
A faster algorithm for packing branchings in digraphs
Discrete Applied Mathematics | 2015-09-01 | Paper |
The eternal dominating set problem for proper interval graphs
Information Processing Letters | 2015-05-21 | Paper |
Removable paths and cycles with parity constraints
Journal of Combinatorial Theory. Series B | 2014-08-28 | Paper |
The online connected facility location problem
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics | 2009-03-04 | Paper |
Removable cycles in non-bipartite graphs
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
A weaker version of Lovász' path removal conjecture
Journal of Combinatorial Theory. Series B | 2008-10-07 | Paper |
Packing Dicycle Covers in Planar Graphs with No K 5–e Minor
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Finding Four Independent Trees
SIAM Journal on Computing | 2006-06-01 | Paper |
Nonseparating Planar Chains in 4-Connected Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Chain Decompositions of 4-Connected Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Non-separating paths in 4-connected graphs
Annals of Combinatorics | 2005-04-28 | Paper |
| scientific article; zbMATH DE number 2079338 (Why is no real title available?) | 2004-07-28 | Paper |
Note on a min-max conjecture of Woodall
Journal of Graph Theory | 2002-08-28 | Paper |
On the Circuit Cover Problem for Mixed Graphs
Combinatorics, Probability and Computing | 2002-05-14 | Paper |
| scientific article; zbMATH DE number 1189241 (Why is no real title available?) | 1998-12-10 | Paper |
