Petru Valicov

Publication Activity (10 Years)

Years Active: 2010-2022
Publications (10 Years): 15

Top Venues

CoRR

Discret. Appl. Math.

Electron. J. Comb.

Eur. J. Comb.

University of Bordeaux, France (PHD)

Education History

University of Bordeaux, France

PHD

Publications

Hoang La, Petru Valicov
Computer assisted discharging procedure on planar graphs: application to 2-distance coloring. CoRR (2022)
Kolja Knauer, Hoang La, Petru Valicov
Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth. Electron. J. Comb. 29 (4) (2022)
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
Exact square coloring of subcubic planar graphs. Discret. Appl. Math. 293 (2021)
Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov
r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9. Eur. J. Comb. 91 (2021)
Kolja Knauer, Hoang La, Petru Valicov
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth. CoRR (2021)
Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov
Cliques in exact distance powers of graphs of given maximum degree. LAGOS (2021)
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
Exact square coloring of subcubic planar graphs. CoRR (2020)
Sarah Blind, Kolja Knauer, Petru Valicov
Enumerating k-Arc-Connected Orientations. Algorithmica 82 (12) (2020)
Kolja Knauer, Petru Valicov
Cuts in matchings of 3-connected cubic graphs. Eur. J. Comb. 76 (2019)
Sarah Blind, Kolja Knauer, Petru Valicov
Enumerating k-arc-connected orientations. CoRR (2019)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theor. Comput. Sci. 668 (2017)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. Algorithmica 78 (3) (2017)
Kolja Knauer, Petru Valicov, Paul S. Wenger
Planar Digraphs without Large Acyclic Sets. J. Graph Theory 85 (1) (2017)
Kolja Knauer, Petru Valicov
Cuts in matchings of 3-edge-connected cubic graphs. CoRR (2017)
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
Strong edge-coloring of (3, Δ)-bipartite graphs. Discret. Math. 339 (1) (2016)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. WG (2015)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. CoRR (2015)
Kolja Knauer, Petru Valicov
Planar digraphs without large acyclic sets. CoRR (2015)
Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, Reza Naserasr, Petru Valicov
From Edge-Coloring to Strong Edge-Coloring. Electron. J. Comb. 22 (2) (2015)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. CoRR (2014)
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
Strong edge-colouring of sparse planar graphs. Discret. Appl. Math. 179 (2014)
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
Strong edge-colouring of sparse planar graphs. CoRR (2014)
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
Strong edge-coloring of $(3, Δ)$-bipartite graphs. CoRR (2014)
Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov
On strong edge-colouring of subcubic graphs. Discret. Appl. Math. 161 (16-17) (2013)
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
Identifying Codes in Line Graphs. J. Graph Theory 73 (4) (2013)
Hervé Hocquard, Pascal Ochem, Petru Valicov
Strong edge-colouring and induced matchings. Inf. Process. Lett. 113 (19-21) (2013)
Cédric Joncour, Arnaud Pêcher, Petru Valicov
MPQ-trees for the Orthogonal Packing Problem. J. Math. Model. Algorithms 11 (1) (2012)
Hervé Hocquard, Pascal Ochem, Petru Valicov
Bounds and complexity results for strong edge colouring of subcubic graphs. Electron. Notes Discret. Math. 38 (2011)
Hervé Hocquard, Petru Valicov
Strong edge colouring of subcubic graphs. Discret. Appl. Math. 159 (15) (2011)
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
Edge identifying codes. Electron. Notes Discret. Math. 38 (2011)
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
Extremal graphs for the identifying code problem. Eur. J. Comb. 32 (4) (2011)
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
Identifying codes in line graphs CoRR (2011)
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
Extremal graphs for the identifying code problem CoRR (2010)
Cédric Joncour, Arnaud Pêcher, Petru Valicov
MPQ-trees for orthogonal packing problem. Electron. Notes Discret. Math. 36 (2010)

Petru Valicov.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Petru Valicov