| Publication | Date of Publication | Type |
|---|
On the parameterized complexity of computing good edge-labelings
Journal of Computer and System Sciences | 2026-02-11 | Paper |
On the hull and interval numbers of oriented graphs (brief announcement)
Procedia Computer Science | 2025-12-11 | Paper |
Semi-proper orientations of dense graphs
Procedia Computer Science | 2025-12-11 | Paper |
An introduction to convexity in graphs. Paper from the 34th Brazilian mathematics colloquium -- 34\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil
Publicações Matemáticas do IMPA | 2024-03-25 | Paper |
| A new framework for kernelization lower bounds: the case of maximum minimal vertex cover | 2024-02-12 | Paper |
On the hull number on cycle convexity of graphs
Information Processing Letters | 2023-10-12 | Paper |
| The iteration time and the general position number in graph convexities | 2023-04-30 | Paper |
Parameterized complexity of computing maximum minimal blocking and hitting sets
Algorithmica | 2023-02-16 | Paper |
Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
Algorithmica | 2022-10-27 | Paper |
Hull and geodetic numbers for some classes of oriented graphs
Electronic Notes in Theoretical Computer Science | 2022-04-27 | 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 |
Hull and Geodetic Numbers for Some Classes of Oriented Graphs
(available as arXiv preprint) | 2019-11-22 | Paper |
| On interval number in cycle convexity | 2018-12-10 | Paper |
Ruling out FPT algorithms for weighted coloring on forests
Theoretical Computer Science | 2018-05-17 | Paper |
Ruling out FPT algorithms for weighted coloring on forests
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
| Weighted coloring in trees | 2017-03-03 | Paper |
Steinberg-like theorems for backbone colouring
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
Proper orientation of cacti
Theoretical Computer Science | 2016-06-30 | Paper |
Weighted coloring in trees
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
On the proper orientation number of bipartite graphs
Theoretical Computer Science | 2015-01-06 | Paper |
Eulerian and Hamiltonian dicycles in directed hypergraphs
Discrete Mathematics, Algorithms and Applications | 2014-04-25 | Paper |
Connectivity inference in mass spectrometry based structure determination
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Good edge-labelling of graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Grundy number on \(P_4\)-classes
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
On the hull number of some graph classes
Theoretical Computer Science | 2013-03-04 | Paper |
Weighted improper colouring
Journal of Discrete Algorithms | 2013-01-18 | Paper |
On the Grundy number of graphs with few \(P_4\)'s
Discrete Applied Mathematics | 2012-11-22 | Paper |
Good edge-labelling of graphs
Discrete Applied Mathematics | 2012-11-22 | Paper |
Weighted Improper Colouring
Lecture Notes in Computer Science | 2012-01-13 | Paper |
On the hull and interval numbers of oriented graphs
(available as arXiv preprint) | N/A | Paper |
