| Publication | Date of Publication | Type |
|---|
| Some results on structure of arbitrary arc-locally (out) in-semicomplete digraphs | 2023-11-15 | Paper |
| On \(\chi \)-diperfect digraphs with stability number two | 2023-07-26 | Paper |
| A family of counterexamples for a conjecture of Berge on \(\alpha\)-diperfect digraphs | 2023-05-31 | Paper |
| Some results on Berge's conjecture and begin-end conjecture | 2022-06-17 | Paper |
| \( \chi \)-diperfect digraphs | 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 | 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}\) | 2021-11-30 | Paper |
| Group parking permit problems | 2020-05-29 | Paper |
| Gallai's path decomposition conjecture for graphs with treewidth at most 3 | 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 | 2019-09-11 | Paper |
| Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs | 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 | 2017-02-27 | Paper |
| A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem | 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 | 2016-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740776 | 2016-07-20 | Paper |
| Spanning trees with nonseparating paths | 2015-10-08 | Paper |
| A faster algorithm for packing branchings in digraphs | 2015-09-01 | Paper |
| The eternal dominating set problem for proper interval graphs | 2015-05-21 | Paper |
| Removable paths and cycles with parity constraints | 2014-08-28 | Paper |
| The Online Connected Facility Location Problem | 2014-03-31 | Paper |
| Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width | 2009-03-04 | Paper |
| Removable cycles in non-bipartite graphs | 2009-01-21 | Paper |
| A weaker version of Lovász' path removal conjecture | 2008-10-07 | Paper |
| Packing Dicycle Covers in Planar Graphs with No K 5–e Minor | 2008-09-18 | Paper |
| Finding Four Independent Trees | 2006-06-01 | Paper |
| Nonseparating Planar Chains in 4-Connected Graphs | 2006-06-01 | Paper |
| Chain Decompositions of 4-Connected Graphs | 2006-06-01 | Paper |
| Non-separating paths in 4-connected graphs | 2005-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471293 | 2004-07-28 | Paper |
| Note on a min-max conjecture of Woodall | 2002-08-28 | Paper |
| On the Circuit Cover Problem for Mixed Graphs | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839006 | 1998-12-10 | Paper |
