default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetru Valicov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j20]Kolja Knauer, Hoang La, Petru Valicov:
Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth. Electron. J. Comb. 29(4) (2022)- [i12]Hoang La, Petru Valicov:
Computer assisted discharging procedure on planar graphs: application to 2-distance coloring. CoRR abs/2202.03885 (2022) - 2021
- [j19]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: 74-89 (2021) - [j18]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: 103219 (2021) - [c2]Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov:
Cliques in exact distance powers of graphs of given maximum degree. LAGOS 2021: 427-436 - [i11]Kolja Knauer, Hoang La, Petru Valicov:
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth. CoRR abs/2111.14986 (2021) - 2020
- [j17]Sarah Blind, Kolja Knauer, Petru Valicov:
Enumerating k-Arc-Connected Orientations. Algorithmica 82(12): 3588-3603 (2020) - [i10]Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov:
Exact square coloring of subcubic planar graphs. CoRR abs/2009.00843 (2020)
2010 – 2019
- 2019
- [j16]Kolja Knauer, Petru Valicov:
Cuts in matchings of 3-connected cubic graphs. Eur. J. Comb. 76: 27-36 (2019) - [i9]Sarah Blind, Kolja Knauer, Petru Valicov:
Enumerating k-arc-connected orientations. CoRR abs/1908.02050 (2019) - 2017
- [j15]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): 914-944 (2017) - [j14]Kolja Knauer, Petru Valicov, Paul S. Wenger:
Planar Digraphs without Large Acyclic Sets. J. Graph Theory 85(1): 288-291 (2017) - [j13]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: 43-58 (2017) - [i8]Kolja Knauer, Petru Valicov:
Cuts in matchings of 3-edge-connected cubic graphs. CoRR abs/1712.06143 (2017) - 2016
- [j12]Julien Bensmail, Aurélie Lagoutte, Petru Valicov:
Strong edge-coloring of (3, Δ)-bipartite graphs. Discret. Math. 339(1): 391-398 (2016) - 2015
- [j11]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): 2 (2015) - [c1]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: 456-471 - [i7]Kolja Knauer, Petru Valicov:
Planar digraphs without large acyclic sets. CoRR abs/1504.06726 (2015) - [i6]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 abs/1507.08164 (2015) - 2014
- [j10]Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov:
Strong edge-colouring of sparse planar graphs. Discret. Appl. Math. 179: 229-234 (2014) - [i5]Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov:
Strong edge-colouring of sparse planar graphs. CoRR abs/1401.4568 (2014) - [i4]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, location-domination and metric dimension on interval and permutation graphs. CoRR abs/1405.2424 (2014) - [i3]Julien Bensmail, Aurélie Lagoutte, Petru Valicov:
Strong edge-coloring of $(3, Δ)$-bipartite graphs. CoRR abs/1412.2624 (2014) - 2013
- [j9]Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov:
On strong edge-colouring of subcubic graphs. Discret. Appl. Math. 161(16-17): 2467-2479 (2013) - [j8]Hervé Hocquard, Pascal Ochem, Petru Valicov:
Strong edge-colouring and induced matchings. Inf. Process. Lett. 113(19-21): 836-843 (2013) - [j7]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying Codes in Line Graphs. J. Graph Theory 73(4): 425-448 (2013) - 2012
- [b1]Petru Valicov:
On packing, colouring and identification problems. (Problèmes de placement, de coloration et d'identification). University of Bordeaux, France, 2012 - [j6]Cédric Joncour, Arnaud Pêcher, Petru Valicov:
MPQ-trees for the Orthogonal Packing Problem. J. Math. Model. Algorithms 11(1): 3-22 (2012) - 2011
- [j5]Hervé Hocquard, Petru Valicov:
Strong edge colouring of subcubic graphs. Discret. Appl. Math. 159(15): 1650-1657 (2011) - [j4]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. Eur. J. Comb. 32(4): 628-638 (2011) - [j3]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Edge identifying codes. Electron. Notes Discret. Math. 38: 343-348 (2011) - [j2]Hervé Hocquard, Pascal Ochem, Petru Valicov:
Bounds and complexity results for strong edge colouring of subcubic graphs. Electron. Notes Discret. Math. 38: 463-468 (2011) - [i2]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying codes in line graphs. CoRR abs/1107.0207 (2011) - 2010
- [j1]Cédric Joncour, Arnaud Pêcher, Petru Valicov:
MPQ-trees for orthogonal packing problem. Electron. Notes Discret. Math. 36: 423-429 (2010) - [i1]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. CoRR abs/1004.5230 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
