| Publication | Date of Publication | Type |
|---|
On the parameterized complexity of computing good edge-labelings
Journal of Computer and System Sciences | 2026-02-11 | Paper |
| Disjoint temporal walks under waiting time constraints | 2025-11-11 | Paper |
Making the interval membership width of temporal graphs connected and bidirectional
Journal of Computer and System Sciences | 2025-09-29 | Paper |
| Making the interval membership width of temporal graphs connected and bidirectional | 2025-02-28 | Paper |
On computing optimal temporal branchings and spanning subgraphs
Journal of Computer and System Sciences | 2024-12-27 | Paper |
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
Networks | 2024-09-05 | Paper |
Snapshot disjointness in temporal graphs
Theoretical Computer Science | 2024-08-20 | Paper |
On computing large temporal (unilateral) connected components
Journal of Computer and System Sciences | 2024-07-01 | Paper |
| On computing optimal temporal branchings | 2024-05-29 | Paper |
| Deciding the Erdős-Pósa Property in 3-Connected Digraphs | 2024-05-03 | Paper |
Maximum cut on interval graphs of interval count four is NP-complete
Discrete & Computational Geometry | 2024-04-02 | Paper |
Acyclic coloring of products of digraphs
Discrete Applied Mathematics | 2024-04-02 | Paper |
| Paths and connectivity in temporal graphs. Textbook for a mini course at the 34th Brazilian mathematics colloquium -- 34\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil, Juli 2023 | 2024-03-25 | Paper |
On computing large temporal (unilateral) connected components
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Mengerian graphs: characterization and recognition
Journal of Computer and System Sciences | 2023-10-24 | Paper |
On the hull number on cycle convexity of graphs
Information Processing Letters | 2023-10-12 | Paper |
MaxCut on permutation graphs is NP‐complete
Journal of Graph Theory | 2023-10-10 | Paper |
scientific article; zbMATH DE number 7724211 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
| Menger's Theorem for Temporal Paths (Not Walks) | 2022-06-30 | Paper |
| Explicit, time-reversible and symplectic integrator for Hamiltonians in isotropic uniformly curved geometries | 2021-04-22 | Paper |
| Cycle convexity and the tunnel number of links | 2020-12-10 | Paper |
On the proper orientation number of chordal graphs
(available as arXiv preprint) | 2020-11-30 | Paper |
On the complexity of finding internally vertex-disjoint long directed paths
Algorithmica | 2020-04-14 | Paper |
On the complexity of finding internally vertex-disjoint long directed paths
Lecture Notes in Computer Science | 2020-02-12 | Paper |
| On Orthogonal Vector Edge Coloring | 2019-09-04 | Paper |
| Complexity of determining the maximum infection time in the geodetic convexity | 2016-10-17 | Paper |
| Fall-colorings and b-colorings of graph products | 2016-07-28 | Paper |
Proper orientation of cacti
Theoretical Computer Science | 2016-06-30 | Paper |
| Trees with small b-chromatic index | 2015-11-18 | Paper |
Backbone colouring: tree backbones with small diameter in planar graphs
Theoretical Computer Science | 2013-12-11 | Paper |
\(B\)-chromatic number of cacti
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
\(b\)-colouring outerplanar graphs with large girth
Discrete Mathematics | 2012-05-30 | Paper |
