Petru Valicov

38 papers B 1C 1Journal 35
YearRankTypeTitle / Venue / Authors
2026 J jnl
Partitions of Planar (Oriented) Graphs into a Connected Acyclic and an Independent Set.
Electron. J. Comb.
Stijn Cambie, François Dross, Kolja Knauer, Hoang La, Petru Valicov
2025 J jnl
Largest planar graphs of diameter
CoRR
Antoine Dailly, Sasha Darmon, Ugo Giocanti, Claire Hilaire, Petru Valicov
2024 J jnl
Partitions of planar (oriented) graphs into a connected acyclic and an independent set.
CoRR
Stijn Cambie, François Dross, Kolja Knauer, Hoang La, Petru Valicov
2022 J jnl
Computer assisted discharging procedure on planar graphs: application to 2-distance coloring.
CoRR
Hoang La, Petru Valicov
2022 J jnl
Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth.
Electron. J. Comb.
Kolja Knauer, Hoang La, Petru Valicov
2021 C conf
Cliques in exact distance powers of graphs of given maximum degree.
LAGOS
Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov
2021 J jnl
Exact square coloring of subcubic planar graphs.
Discret. Appl. Math.
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
2021 J jnl
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth.
CoRR
Kolja Knauer, Hoang La, Petru Valicov
2021 J jnl
r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9.
Eur. J. Comb.
Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov
2020 J jnl
Enumerating k-Arc-Connected Orientations.
Algorithmica
Sarah Blind, Kolja Knauer, Petru Valicov
2020 J jnl
Exact square coloring of subcubic planar graphs.
CoRR
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
2019 J jnl
Cuts in matchings of 3-connected cubic graphs.
Eur. J. Comb.
Kolja Knauer, Petru Valicov
2019 J jnl
Enumerating k-arc-connected orientations.
CoRR
Sarah Blind, Kolja Knauer, Petru Valicov
2017 J jnl
Cuts in matchings of 3-edge-connected cubic graphs.
CoRR
Kolja Knauer, Petru Valicov
2017 J jnl
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity.
Algorithmica
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2017 J jnl
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.
Theor. Comput. Sci.
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2017 J jnl
Planar Digraphs without Large Acyclic Sets.
J. Graph Theory
Kolja Knauer, Petru Valicov, Paul S. Wenger
2016 J jnl
Strong edge-coloring of (3, Δ)-bipartite graphs.
Discret. Math.
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
2015 B conf
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.
WG
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2015 J jnl
From Edge-Coloring to Strong Edge-Coloring.
Electron. J. Comb.
Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, Reza Naserasr, Petru Valicov
2015 J jnl
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.
CoRR
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2015 J jnl
Planar digraphs without large acyclic sets.
CoRR
Kolja Knauer, Petru Valicov
2014 J jnl
Identification, location-domination and metric dimension on interval and permutation graphs.
CoRR
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2014 J jnl
Strong edge-coloring of $(3, Δ)$-bipartite graphs.
CoRR
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
2014 J jnl
Strong edge-colouring of sparse planar graphs.
CoRR
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
2014 J jnl
Strong edge-colouring of sparse planar graphs.
Discret. Appl. Math.
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
2013 J jnl
Identifying Codes in Line Graphs.
J. Graph Theory
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
2013 J jnl
On strong edge-colouring of subcubic graphs.
Discret. Appl. Math.
Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov
2013 J jnl
Strong edge-colouring and induced matchings.
Inf. Process. Lett.
Hervé Hocquard, Pascal Ochem, Petru Valicov
2012 J jnl
MPQ-trees for the Orthogonal Packing Problem.
J. Math. Model. Algorithms
Cédric Joncour, Arnaud Pêcher, Petru Valicov
2012 — —
On packing, colouring and identification problems. (Problèmes de placement, de coloration et d'identification).
Petru Valicov
2011 J jnl
Bounds and complexity results for strong edge colouring of subcubic graphs.
Electron. Notes Discret. Math.
Hervé Hocquard, Pascal Ochem, Petru Valicov
2011 J jnl
Edge identifying codes.
Electron. Notes Discret. Math.
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
2011 J jnl
Extremal graphs for the identifying code problem.
Eur. J. Comb.
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
2011 J jnl
Identifying codes in line graphs
CoRR
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
2011 J jnl
Strong edge colouring of subcubic graphs.
Discret. Appl. Math.
Hervé Hocquard, Petru Valicov
2010 J jnl
Extremal graphs for the identifying code problem
CoRR
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
2010 J jnl
MPQ-trees for orthogonal packing problem.
Electron. Notes Discret. Math.
Cédric Joncour, Arnaud Pêcher, Petru Valicov