| Publication | Date of Publication | Type |
|---|
Semi-proper orientations of dense graphs
Procedia Computer Science | 2025-12-11 | Paper |
Semi-proper orientations of dense graphs
Discrete Applied Mathematics | 2025-05-19 | Paper |
k-fault-tolerant graphs for p disjoint complete graphs of order c
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
Zero-sum partitions of abelian groups and their applications to magic- and antimagic-type labelings
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
A case study of consistent vehicle routing problem with time windows
International Transactions in Operational Research | 2023-11-21 | Paper |
| Minimum $k$-critical-bipartite graphs: the irregular Case | 2023-07-14 | Paper |
| $k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$ | 2022-12-13 | Paper |
Territory design for the multi-period vehicle routing problem with time windows
Computers & Operations Research | 2022-06-22 | Paper |
| Local Optima Network Analysis of Multi-attribute Vehicle Routing Problem | 2022-05-25 | Dataset |
| Zero-sum Partitions of Abelian Groups | 2022-03-17 | Paper |
| Constrained Fitness Landscape Analysis of Vehicle Routing Problems | 2021-09-27 | Dataset |
Minimum \(k\)-critical bipartite graphs
Discrete Applied Mathematics | 2021-08-02 | Paper |
Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows
(available as arXiv preprint) | 2020-12-18 | Paper |
| On interval number in cycle convexity | 2018-12-10 | Paper |
Minimum size tree-decompositions
Discrete Applied Mathematics | 2018-05-24 | Paper |
Minimum size tree-decompositions
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
Computing on rings by oblivious robots: a unified approach for different tasks
Algorithmica | 2015-09-02 | Paper |
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Distributed Computing | 2015-07-22 | Paper |
Complexity of splits reconstruction for low-degree trees
Discrete Applied Mathematics | 2014-11-28 | Paper |
Towards optimal kernel for connected vertex cover in planar graphs
Discrete Applied Mathematics | 2013-04-25 | Paper |
\(k\)-chordal graphs: from cops and robber to compact routing via treewidth
Automata, Languages, and Programming | 2012-11-01 | Paper |
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science | 2012-08-10 | Paper |
\(k\)-gap interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Complexity of splits reconstruction for low-degree trees
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
On dissemination thresholds in regular and irregular graph classes
Algorithmica | 2011-03-02 | Paper |
Minimal proper interval completions
Information Processing Letters | 2010-04-19 | Paper |
Pursuing a fast robber on a graph
Theoretical Computer Science | 2010-03-09 | Paper |
Distributed computing of efficient routing schemes in generalized chordal graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Computing Pathwidth Faster Than 2 n
Parameterized and Exact Computation | 2010-01-14 | Paper |
Minimal interval completion through graph exploration
Theoretical Computer Science | 2009-02-19 | Paper |
Fast Robber in Planar Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Minimal Proper Interval Completions
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Pathwidth of Circular-Arc Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Minimal Interval Completion Through Graph Exploration
Algorithms and Computation | 2008-04-24 | Paper |
On Dissemination Thresholds in Regular and Irregular Graph Classes
Lecture Notes in Computer Science | 2008-04-15 | Paper |
On powers of graphs of bounded NLC-width (clique-width)
Discrete Applied Mathematics | 2007-09-19 | Paper |
Characterizing Minimal Interval Completions
STACS 2007 | 2007-09-03 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
