Остановите войну!
for scientists:
default search action
Petr A. Golovach
- > Home > Persons > Petr A. Golovach
Publications
- 2017
- [j79]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a planar graph of given degrees. J. Comput. Syst. Sci. 85: 168-182 (2017) - 2016
- [j67]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian graphs. J. Comput. Syst. Sci. 82(2): 213-228 (2016) - 2015
- [j63]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
Modifying a Graph Using Vertex Elimination. Algorithmica 72(1): 99-125 (2015) - [j57]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. 29(3): 1427-1451 (2015) - [c83]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. CSR 2015: 143-156 - [i24]Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. CoRR abs/1508.02773 (2015) - 2014
- [j55]Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica 51(7): 473-497 (2014) - [j54]Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica 69(3): 501-521 (2014) - [c74]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. FSTTCS 2014: 97-108 - [c70]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. WG 2014: 201-213 - [i20]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger number of graphs with small chordality. CoRR abs/1406.3812 (2014) - [i18]Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. CoRR abs/1410.6863 (2014) - 2013
- [j40]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Choosability on H-free graphs. Inf. Process. Lett. 113(4): 107-110 (2013) - [j38]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining planarity by contracting few edges. Theor. Comput. Sci. 476: 38-46 (2013) - [c60]Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. IPEC 2013: 16-27 - 2012
- [c47]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges. MFCS 2012: 455-466 - [c42]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
How to Eliminate a Graph. WG 2012: 320-331 - [i5]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges. CoRR abs/1204.5113 (2012) - 2011
- [c38]Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC 2011: 110-119
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-05-09 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint