default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr A. Golovach
Person information
- affiliation: University of Bergen
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j139]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. Algorithmica 86(6): 2026-2040 (2024)- [j138]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. Algorithmica 86(8): 2676-2713 (2024) - [j137]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar
, Tomohiro Koana:
FPT approximation and subexponential algorithms for covering few or many edges. Inf. Process. Lett. 185: 106471 (2024) - [j136]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse collections in matroids and graphs. Math. Program. 204(1): 415-447 (2024) - [j135]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20(1): 2:1-2:16 (2024) - [j134]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis:
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. ACM Trans. Algorithms 20(4): 36:1-36:48 (2024) - [j133]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Parameterized complexity of broadcasting in graphs. Theor. Comput. Sci. 997: 114508 (2024) - [c165]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Hybrid k-Clustering: Blending k-Median and k-Center. APPROX/RANDOM 2024: 4:1-4:19 - [c164]Tatiana Belova, Yuriy Dementiev, Fedor V. Fomin, Petr A. Golovach, Artur Ignatiev:
How to Guide a Present-Biased Agent Through Prescribed Tasks? ECAI 2024: 3461-3468 - [c163]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. ESA 2024: 17:1-17:15 - [c162]Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen:
Two-Sets Cut-Uncut on Planar Graphs. ICALP 2024: 22:1-22:18 - [c161]Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. ICALP 2024: 51:1-51:18 - [c160]Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh:
Breaking a Graph into Connected Components with Small Dominating Sets. MFCS 2024: 24:1-24:15 - [c159]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Tree Containment Above Minimum Degree is FPT. SODA 2024: 366-376 - [c158]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. SWAT 2024: 22:1-22:16 - [i102]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach:
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR abs/2402.15348 (2024) - [i101]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR abs/2403.05943 (2024) - [i100]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. CoRR abs/2404.03979 (2024) - [i99]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. CoRR abs/2406.19134 (2024) - [i98]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Hybrid k-Clustering: Blending k-Median and k-Center. CoRR abs/2407.08295 (2024) - [i97]Tatiana Belova, Yuriy Dementiev, Fedor V. Fomin, Petr A. Golovach, Artur Ignatiev:
How to guide a present-biased agent through prescribed tasks? CoRR abs/2408.13675 (2024) - 2023
- [j132]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov:
How to find a good explanation for clustering? Artif. Intell. 322: 103948 (2023) - [j131]Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach:
A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48: 100556 (2023) - [j130]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Inf. Comput. 293: 105049 (2023) - [j129]Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit:
Parameterized complexity of categorical clustering with size constraints. J. Comput. Syst. Sci. 136: 171-194 (2023) - [j128]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov:
Detours in directed graphs. J. Comput. Syst. Sci. 137: 66-86 (2023) - [j127]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67(4): 785-824 (2023) - [j126]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Combing a Linkage in an Annulus. SIAM J. Discret. Math. 37(4): 2332-2364 (2023) - [j125]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. ACM Trans. Algorithms 19(3): 23:1-23:29 (2023) - [j124]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of Feature Selection for Categorical Data Clustering. ACM Trans. Comput. Theory 15(3-4): 7:1-7:24 (2023) - [c157]Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach:
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. CIAC 2023: 353-367 - [c156]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. ESA 2023: 48:1-48:16 - [c155]Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser:
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. FCT 2023: 392-405 - [c154]Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper:
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. GD (2) 2023: 189-202 - [c153]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. ICALP 2023: 60:1-60:18 - [c152]Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Compound Logics for Modification Problems. ICALP 2023: 61:1-61:21 - [c151]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis:
Computing Paths of Large Rank in Planar Frameworks Deterministically. ISAAC 2023: 32:1-32:15 - [c150]Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf:
Kernelizing Temporal Exploration Problems. IPEC 2023: 1:1-1:18 - [c149]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana:
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS 2023: 46:1-46:8 - [c148]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles With Monotone Submodular Costs. SODA 2023: 2214-2227 - [c147]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. SODA 2023: 3684-3699 - [c146]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis:
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA 2023: 3700-3712 - [c145]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Parameterized Complexity of Broadcasting in Graphs. WG 2023: 334-347 - [c144]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Turán's Theorem Through Algorithmic Lens. WG 2023: 348-362 - [i96]Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf:
Kernelizing Temporal Exploration Problems. CoRR abs/2302.10110 (2023) - [i95]Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen:
Two-sets cut-uncut on planar graphs. CoRR abs/2305.01314 (2023) - [i94]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis:
Computing paths of large rank in planar frameworks deterministically. CoRR abs/2305.01993 (2023) - [i93]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. CoRR abs/2305.02011 (2023) - [i92]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Parameterized Complexity of Broadcasting in Graphs. CoRR abs/2306.01536 (2023) - [i91]Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser:
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. CoRR abs/2307.00362 (2023) - [i90]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Turán's Theorem Through Algorithmic Lens. CoRR abs/2307.07456 (2023) - [i89]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. CoRR abs/2308.07099 (2023) - [i88]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana:
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. CoRR abs/2308.15546 (2023) - [i87]Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper:
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. CoRR abs/2308.15635 (2023) - [i86]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Tree Containment Above Minimum Degree is FPT. CoRR abs/2310.09678 (2023) - 2022
- [j123]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84(8): 2292-2308 (2022) - [j122]Petr A. Golovach, Meirav Zehavi:
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. Algorithmica 84(11): 3107-3109 (2022) - [j121]Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith:
Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. 29(2) (2022) - [j120]Christophe Crespelle, Petr A. Golovach:
Cyclability in graph classes. Discret. Appl. Math. 313: 147-178 (2022) - [j119]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123: 76-102 (2022) - [j118]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-free graphs. J. Comput. Syst. Sci. 124: 170-191 (2022) - [j117]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Present-biased optimization. Math. Soc. Sci. 119: 56-67 (2022) - [j116]Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst. 66(4): 821-846 (2022) - [j115]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Partitioning H-free graphs of bounded diameter. Theor. Comput. Sci. 930: 37-52 (2022) - [j114]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Trans. Comput. Log. 23(3): 17:1-17:35 (2022) - [j113]Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory 14(3-4): 1-29 (2022) - [c143]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov:
How to Find a Good Explanation for Clustering? AAAI 2022: 3904-3912 - [c142]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. CSR 2022: 96-114 - [c141]Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh:
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR 2022: 152-169 - [c140]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Longest Cycle Above Erdős-Gallai Bound. ESA 2022: 55:1-55:15 - [c139]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. ICALP 2022: 60:1-60:17 - [c138]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
FPT Approximation for Fair Minimum-Load Clustering. IPEC 2022: 4:1-4:14 - [c137]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. IPEC 2022: 13:1-13:14 - [c136]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). MFCS 2022: 1:1-1:4 - [c135]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Algorithmic Extensions of Dirac's Theorem. SODA 2022: 406-416 - [c134]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. STACS 2022: 29:1-29:16 - [i85]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. CoRR abs/2201.03318 (2022) - [i84]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Longest Cycle above Erdős-Gallai Bound. CoRR abs/2202.03061 (2022) - [i83]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis:
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR abs/2207.07449 (2022) - [i82]Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. CoRR abs/2207.09993 (2022) - [i81]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. CoRR abs/2208.06847 (2022) - [i80]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. CoRR abs/2211.01723 (2022) - [i79]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles With Monotone Submodular Costs. CoRR abs/2211.04797 (2022) - [i78]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. CoRR abs/2211.09603 (2022) - 2021
- [j112]Fedor V. Fomin, Petr A. Golovach:
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. Algorithmica 83(7): 2170-2214 (2021) - [j111]Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized k-Clustering: Tractability island. J. Comput. Syst. Sci. 117: 50-74 (2021) - [j110]Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM J. Discret. Math. 35(2): 840-892 (2021) - [j109]Fedor V. Fomin, Petr A. Golovach:
Kernelization of Whitney Switches. SIAM J. Discret. Math. 35(2): 1298-1336 (2021) - [j108]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13(3): 18:1-18:16 (2021) - [c133]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Present-Biased Optimization. AAAI 2021: 5415-5422 - [c132]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh:
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS 2021: 21:1-21:16 - [c131]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Partitioning H-Free Graphs of Bounded Diameter. ISAAC 2021: 21:1-21:14 - [c130]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. LICS 2021: 1-13 - [c129]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS 2021: 14:1-14:14 - [c128]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. SODA 2021: 2649-2659 - [c127]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. STACS 2021: 31:1-31:14 - [c126]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS 2021: 37:1-37:18 - [c125]Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit:
Parameterized Complexity of Categorical Clustering with Size Constraints. WADS 2021: 385-398 - [c124]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. WG 2021: 308-320 - [c123]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG 2021: 336-348 - [e1]Petr A. Golovach, Meirav Zehavi:
16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal. LIPIcs 214, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-216-7 [contents] - [i77]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR abs/2101.03800 (2021) - [i76]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. CoRR abs/2101.04633 (2021) - [i75]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs. CoRR abs/2102.13409 (2021) - [i74]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. CoRR abs/2104.02998 (2021) - [i73]Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit:
Parameterized Complexity of Categorical Clustering with Size Constraints. CoRR abs/2104.07974 (2021) - [i72]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR abs/2104.10593 (2021) - [i71]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of Feature Selection for Categorical Data Clustering. CoRR abs/2105.03753 (2021) - [i70]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Partitioning H-Free Graphs of Bounded Diameter. CoRR abs/2105.04588 (2021) - [i69]Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR abs/2106.03425 (2021) - [i68]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh:
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. CoRR abs/2107.06715 (2021) - [i67]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. CoRR abs/2107.07383 (2021) - [i66]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
FPT Approximation for Fair Minimum-Load Clustering. CoRR abs/2107.09481 (2021) - [i65]Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Compound Logics for Modification Problems. CoRR abs/2111.02755 (2021) - [i64]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov:
How to Find a Good Explanation for Clustering? CoRR abs/2112.06580 (2021) - 2020
- [j107]Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Subgraph Complementation. Algorithmica 82(7): 1859-1880 (2020) - [j106]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. Algorithmica 82(7): 2006-2038 (2020) - [j105]Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the Tractability of Optimization Problems on H-Graphs. Algorithmica 82(9): 2432-2473 (2020) - [j104]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
Enumeration of minimal connected dominating sets for chordal graphs. Discret. Appl. Math. 278: 3-11 (2020) - [j103]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. 34(2): 478-532 (2020) - [j102]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding connected secluded subgraphs. J. Comput. Syst. Sci. 113: 101-124 (2020) - [j101]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Theory Comput. Syst. 64(2): 251-271 (2020) - [j100]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far from Degeneracy. SIAM J. Discret. Math. 34(3): 1587-1601 (2020) - [j99]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms 16(1): 12:1-12:39 (2020) - [c122]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov:
Low-Rank Binary Matrix Approximation in Column-Sum Norm. APPROX-RANDOM 2020: 32:1-32:18 - [c121]Fedor V. Fomin, Petr A. Golovach:
Kernelization of Whitney Switches. ESA 2020: 48:1-48:19 - [c120]Fedor V. Fomin, Petr A. Golovach:
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. ESA 2020: 49:1-49:17 - [c119]Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan:
On the Complexity of Recovering Incidence Matrices. ESA 2020: 50:1-50:13 - [c118]Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ESA 2020: 51:1-51:17 - [c117]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Parameterization Above a Multiplicative Guarantee. ITCS 2020: 39:1-39:13 - [c116]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. ISAAC 2020: 26:1-26:12 - [c115]Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop:
Recognizing Proper Tree-Graphs. IPEC 2020: 8:1-8:15 - [c114]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. IPEC 2020: 12:1-12:11 - [c113]Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. LATIN 2020: 104-115 - [c112]Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. LATIN 2020: 116-128 - [c111]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. SODA 2020: 931-950 - [c110]Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of PCA (Invited Talk). SWAT 2020: 1:1-1:5 - [i63]Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach:
A survey of parameterized algorithms and the complexity of edge modification. CoRR abs/2001.06867 (2020) - [i62]Fedor V. Fomin, Petr A. Golovach:
Subexponential parameterized algorithms and kernelization on almost chordal graphs. CoRR abs/2002.08226 (2020) - [i61]Fedor V. Fomin, Petr A. Golovach:
Kernelization of Whitney Switches. CoRR abs/2006.13684 (2020) - [i60]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. CoRR abs/2009.04567 (2020) - [i59]Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. CoRR abs/2010.05733 (2020) - [i58]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. CoRR abs/2010.09580 (2020) - [i57]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Algorithmic Extensions of Dirac's Theorem. CoRR abs/2011.03619 (2020) - [i56]Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop:
Recognizing Proper Tree-Graphs. CoRR abs/2011.11670 (2020) - [i55]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-free Graphs. CoRR abs/2012.09814 (2020) - [i54]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Present-Biased Optimization. CoRR abs/2012.14736 (2020)
2010 – 2019
- 2019
- [j98]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma:
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica 81(7): 2795-2828 (2019) - [j97]Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
Surjective H-colouring: New hardness results. Comput. 8(1): 27-42 (2019) - [j96]Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and maximum number of maximal irredundant sets for chordal graphs. Discret. Appl. Math. 265: 69-85 (2019) - [j95]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh:
Editing to Connected F-Degree Graph. SIAM J. Discret. Math. 33(2): 795-836 (2019) - [j94]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms 15(1): 9:1-9:27 (2019) - [j93]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. ACM Trans. Algorithms 15(4): 52:1-52:38 (2019) - [j92]Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi:
Enumeration of maximal irredundant sets for claw-free graphs. Theor. Comput. Sci. 754: 3-15 (2019) - [j91]Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and maximum number of minimal dominating sets for chordal graphs. Theor. Comput. Sci. 783: 41-52 (2019) - [c109]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. ESA 2019: 47:1-47:14 - [c108]Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized k-Clustering: Tractability Island. FSTTCS 2019: 14:1-14:15 - [c107]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. ICALP 2019: 59:1-59:13 - [c106]Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Refined Complexity of PCA with Outliers. ICML 2019: 5818-5826 - [c105]Christophe Crespelle, Carl Feghali, Petr A. Golovach:
Cyclability in Graph Classes. ISAAC 2019: 16:1-16:13 - [c104]Petr A. Golovach, Dimitrios M. Thilikos:
Clustering to Given Connectivities. IPEC 2019: 18:1-18:17 - [c103]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Modification to Planarity is Fixed Parameter Tractable. STACS 2019: 28:1-28:17 - [c102]Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. WADS 2019: 296-310 - [i53]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. CoRR abs/1902.02526 (2019) - [i52]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. CoRR abs/1902.06957 (2019) - [i51]Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized k-Clustering: The distance matters! CoRR abs/1902.08559 (2019) - [i50]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov:
Low-rank binary matrix approximation in column-sum norm. CoRR abs/1904.06141 (2019) - [i49]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov:
Refined Complexity of PCA with Outliers. CoRR abs/1905.04124 (2019) - [i48]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. CoRR abs/1907.02919 (2019) - 2018
- [j90]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger:
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica 80(2): 714-741 (2018) - [j89]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Computing square roots of graphs with low maximum degree. Discret. Appl. Math. 248: 93-101 (2018) - [j88]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and maximum number of minimal connected vertex covers in graphs. Eur. J. Comb. 68: 132-147 (2018) - [j87]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Finding Cactus Roots in Polynomial Time. Theory Comput. Syst. 62(6): 1409-1426 (2018) - [j86]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering Vectors by Spaces: Regular Matroids. SIAM J. Discret. Math. 32(4): 2512-2565 (2018) - [j85]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Structured Connectivity Augmentation. SIAM J. Discret. Math. 32(4): 2612-2635 (2018) - [c101]Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the Tractability of Optimization Problems on H-Graphs. ESA 2018: 30:1-30:14 - [c100]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Parameterized Low-Rank Binary Matrix Approximation. ICALP 2018: 53:1-53:16 - [c99]Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. SODA 2018: 262-273 - [c98]Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Partial Complementation of Graphs. SWAT 2018: 21:1-21:13 - [c97]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. SWAT 2018: 23:1-23:13 - [i47]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. CoRR abs/1802.10386 (2018) - [i46]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Parameterized Low-Rank Binary Matrix Approximation. CoRR abs/1803.06102 (2018) - [i45]Petr A. Golovach, Dimitrios M. Thilikos:
Clustering to Given Connectivities. CoRR abs/1803.09483 (2018) - [i44]Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Partial complementation of graphs. CoRR abs/1804.10920 (2018) - [i43]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. CoRR abs/1805.04375 (2018) - [i42]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. CoRR abs/1807.07156 (2018) - [i41]Henning Fernau, Petr A. Golovach, Marie-France Sagot:
Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421). Dagstuhl Reports 8(10): 63-86 (2018) - 2017
- [j84]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. Algorithmica 79(3): 798-813 (2017) - [j83]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. 216: 162-170 (2017) - [j82]Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
On recognition of threshold tolerance graphs and their complements. Discret. Appl. Math. 216: 171-180 (2017) - [j81]Petr A. Golovach, Daniël Paulusma, Iain A. Stewart:
Graph editing to a fixed target. Discret. Appl. Math. 216: 181-190 (2017) - [j80]Petr A. Golovach:
Editing to a connected graph of given degrees. Inf. Comput. 256: 131-147 (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) - [j78]Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song:
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. J. Graph Theory 84(4): 331-363 (2017) - [j77]Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. Theory Comput. Syst. 61(3): 795-819 (2017) - [j76]Petr A. Golovach, Marcin Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. SIAM J. Discret. Math. 31(1): 511-541 (2017) - [j75]Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Tree-length Graphs. SIAM J. Discret. Math. 31(2): 1217-1243 (2017) - [j74]Petr A. Golovach, George B. Mertzios:
Graph editing to a given degree sequence. Theor. Comput. Sci. 665: 1-12 (2017) - [j73]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A linear kernel for finding square roots of almost planar graphs. Theor. Comput. Sci. 689: 36-47 (2017) - [c96]Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi:
Enumeration of Maximal Irredundant Sets for Claw-Free Graphs. CIAC 2017: 297-309 - [c95]Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
Surjective H-Colouring: New Hardness Results. CiE 2017: 270-281 - [c94]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering Vectors by Spaces: Regular Matroids. ICALP 2017: 56:1-56:15 - [c93]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. IPEC 2017: 18:1-18:13 - [c92]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Structured Connectivity Augmentation. MFCS 2017: 29:1-29:13 - [c91]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. SODA 2017: 1433-1441 - [c90]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma:
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG 2017: 275-288 - [c89]Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. WG 2017: 289-302 - [i40]Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
Surjective H-Colouring: New Hardness Results. CoRR abs/1701.02188 (2017) - [i39]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma:
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. CoRR abs/1703.05102 (2017) - [i38]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Structured Connectivity Augmentation. CoRR abs/1706.04255 (2017) - [i37]Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the tractability of optimization problems on H-graphs. CoRR abs/1709.09737 (2017) - [i36]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering vectors by spaces: Regular matroids. CoRR abs/1710.02300 (2017) - [i35]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. CoRR abs/1710.10979 (2017) - 2016
- [j72]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Parameterized Algorithms for Finding Square Roots. Algorithmica 74(2): 602-629 (2016) - [j71]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199: 30-36 (2016) - [j70]Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk:
How to hunt an invisible rabbit on a graph. Eur. J. Comb. 52: 12-26 (2016) - [j69]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Squares of Low Clique Number. Electron. Notes Discret. Math. 55: 195-198 (2016) - [j68]Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach:
Parameterized complexity of the anchored k-core problem for directed graphs. Inf. Comput. 247: 11-22 (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) - [j66]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumerating minimal connected dominating sets in graphs of bounded chordality. Theor. Comput. Sci. 630: 63-75 (2016) - [j65]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced disjoint paths in circular-arc graphs in linear time. Theor. Comput. Sci. 640: 70-83 (2016) - [c88]Petr A. Golovach, George B. Mertzios:
Graph Editing to a Given Degree Sequence. CSR 2016: 177-191 - [c87]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Finding Cactus Roots in Polynomial Time. IWOCA 2016: 361-372 - [c86]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh:
Editing to Connected f-Degree Graph. STACS 2016: 36:1-36:14 - [c85]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A Linear Kernel for Finding Square Roots of Almost Planar Graphs. SWAT 2016: 4:1-4:14 - [i34]Petr A. Golovach, George B. Mertzios:
Graph Editing to a Given Degree Sequence. CoRR abs/1601.03174 (2016) - [i33]Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Tree-length Graphs. CoRR abs/1602.02610 (2016) - [i32]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. CoRR abs/1602.07504 (2016) - [i31]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. CoRR abs/1607.05516 (2016) - [i30]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A Linear Kernel for Finding Square Roots of Almost Planar Graphs. CoRR abs/1608.06136 (2016) - [i29]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Squares of Low Maximum Degree. CoRR abs/1608.06142 (2016) - 2015
- [j64]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. Algorithmica 71(1): 21-35 (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) - [j62]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica 72(3): 836-859 (2015) - [j61]Petr A. Golovach, Daniël Paulusma, Bernard Ries:
Coloring graphs characterized by a forbidden subgraph. Discret. Appl. Math. 180: 101-110 (2015) - [j60]Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory 79(4): 282-299 (2015) - [j59]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. Theory Comput. Syst. 57(1): 81-96 (2015) - [j58]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. SIAM J. Discret. Math. 29(1): 348-375 (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) - [j56]Petr A. Golovach:
Editing to a Graph of Given Degrees. Theor. Comput. Sci. 591: 72-84 (2015) - [c84]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CPM 2015: 89-99 - [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 - [c82]Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. FSTTCS 2015: 408-419 - [c81]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger:
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC 2015: 248-258 - [c80]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. IWOCA 2015: 235-247 - [c79]Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos:
Variants of Plane Diameter Completion. IPEC 2015: 30-42 - [c78]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. IPEC 2015: 307-318 - [c77]Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Width Graphs. MFCS (2) 2015: 115-126 - [i28]Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk:
How to Hunt an Invisible Rabbit on a Graph. CTW 2015: 169-172 - [i27]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CoRR abs/1502.01461 (2015) - [i26]Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. CoRR abs/1502.03989 (2015) - [i25]Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk:
How to Hunt an Invisible Rabbit on a Graph. CoRR abs/1502.05614 (2015) - [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) - [i23]Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos:
Variants of Plane Diameter Completion. CoRR abs/1509.00757 (2015) - [i22]Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger:
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR abs/1509.03753 (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) - [j53]Petr A. Golovach, Daniël Paulusma:
List coloring in the absence of two subgraphs. Discret. Appl. Math. 166: 123-130 (2014) - [j52]Petr A. Golovach, Daniël Paulusma, Jian Song:
Coloring graphs without short cycles and long induced paths. Discret. Appl. Math. 167: 107-120 (2014) - [j51]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Finding clubs in graph classes. Discret. Appl. Math. 174: 57-65 (2014) - [j50]Petr A. Golovach, Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos:
Lift-contractions. Eur. J. Comb. 35: 286-296 (2014) - [j49]Petr A. Golovach, Daniël Paulusma, Jian Song:
Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput. 237: 204-214 (2014) - [j48]Fedor V. Fomin, Petr A. Golovach:
Parameterized complexity of connected even/odd subgraph problems. J. Comput. Syst. Sci. 80(1): 157-179 (2014) - [j47]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
Subset feedback vertex sets in chordal graphs. J. Discrete Algorithms 26: 7-15 (2014) - [j46]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width. SIAM J. Comput. 43(5): 1541-1563 (2014) - [j45]Fedor V. Fomin, Petr A. Golovach:
Long Circuits and Large Euler Subgraphs. SIAM J. Discret. Math. 28(2): 878-892 (2014) - [j44]Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma:
Colouring of graphs with Ramsey-type forbidden subgraphs. Theor. Comput. Sci. 522: 34-43 (2014) - [j43]Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
Solutions for the stable roommates problem with payments. Theor. Comput. Sci. 540: 53-61 (2014) - [c76]Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. ESA 2014: 492-504 - [c75]Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh:
Connecting Vertices by Independent Trees. FSTTCS 2014: 73-84 - [c74]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. FSTTCS 2014: 97-108 - [c73]Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms to Preserve Connectivity. ICALP (1) 2014: 800-811 - [c72]Petr A. Golovach:
Editing to a Graph of Given Degrees. IPEC 2014: 196-207 - [c71]Petr A. Golovach:
Editing to a Connected Graph of Given Degrees. MFCS (2) 2014: 324-335 - [c70]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. WG 2014: 201-213 - [c69]Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad:
Recognizing Threshold Tolerance Graphs in O(n2) Time. WG 2014: 214-224 - [c68]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. WG 2014: 225-237 - [i21]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. CoRR abs/1403.0789 (2014) - [i20]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger number of graphs with small chordality. CoRR abs/1406.3812 (2014) - [i19]Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song:
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs. CoRR abs/1407.1482 (2014) - [i18]Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. CoRR abs/1410.6863 (2014) - [i17]Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. CoRR abs/1412.3955 (2014) - 2013
- [j42]Petr A. Golovach, Daniël Paulusma, Jian Song:
4-coloring H-free graphs when H is small. Discret. Appl. Math. 161(1-2): 140-150 (2013) - [j41]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three complexity results on coloring Pk-free graphs. Eur. J. Comb. 34(3): 609-619 (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) - [j39]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin:
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52(4): 645-667 (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) - [j37]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. 481: 74-84 (2013) - [j36]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Detecting induced minors in AT-free graphs. Theor. Comput. Sci. 482: 20-32 (2013) - [j35]Hajo Broersma, Petr A. Golovach, Viresh Patel:
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. 485: 69-84 (2013) - [c67]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Preventing Unraveling in Social Networks Gets Harder. AAAI 2013: 1085-1091 - [c66]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Cliques and Clubs. CIAC 2013: 276-287 - [c65]Petr A. Golovach, Daniël Paulusma:
List Coloring in the Absence of Two Subgraphs. CIAC 2013: 288-299 - [c64]Fedor V. Fomin, Petr A. Golovach:
Long Circuits and Large Euler Subgraphs. ESA 2013: 493-504 - [c63]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. FSTTCS 2013: 79-90 - [c62]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. ICALP (1) 2013: 485-496 - [c61]Petr A. Golovach, Daniël Paulusma, Iain A. Stewart:
Graph Editing to a Fixed Target. IWOCA 2013: 192-205 - [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 - [c59]Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen:
On the Parameterized Complexity of Cutting a Few Vertices from a Graph. MFCS 2013: 421-432 - [c58]Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG 2013: 127-138 - [c57]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Sparse Square Roots. WG 2013: 177-188 - [c56]Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma:
Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. WG 2013: 201-212 - [i16]Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. CoRR abs/1301.5953 (2013) - [i15]Fedor V. Fomin, Petr A. Golovach:
Long Circuits and Large Euler Subgraphs. CoRR abs/1304.5746 (2013) - [i14]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. CoRR abs/1304.5870 (2013) - [i13]Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen:
On the parameterized complexity of cutting a few vertices from a graph. CoRR abs/1304.6189 (2013) - [i12]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Preventing Unraveling in Social Networks Gets Harder. CoRR abs/1304.6420 (2013) - [i11]Petr A. Golovach:
Editing to a Connected Graph of Given Degrees. CoRR abs/1308.1802 (2013) - [i10]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. CoRR abs/1309.6797 (2013) - [i9]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Parameterized Algorithms for Finding Square Roots. CoRR abs/1310.5469 (2013) - [i8]Petr A. Golovach:
Editing to a Graph of Given Degrees. CoRR abs/1311.4768 (2013) - 2012
- [j34]Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding vertex-surjective graph homomorphisms. Acta Informatica 49(6): 381-394 (2012) - [j33]Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen:
Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012) - [j32]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Containment relations in split graphs. Discret. Appl. Math. 160(1-2): 155-163 (2012) - [j31]Petr A. Golovach, Pinar Heggernes, Rodica Mihai:
Edge search number of cographs. Discret. Appl. Math. 160(6): 734-743 (2012) - [j30]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma:
Distance three labelings of trees. Discret. Appl. Math. 160(6): 764-779 (2012) - [j29]Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý:
Parameterized complexity of generalized domination problems. Discret. Appl. Math. 160(6): 780-792 (2012) - [j28]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms 15: 56-62 (2012) - [j27]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Cops and Robber Game Without Recharging. Theory Comput. Syst. 50(4): 611-620 (2012) - [j26]Fedor V. Fomin, Petr A. Golovach, Pawel Pralat:
Cops and Robber with Constraints. SIAM J. Discret. Math. 26(2): 571-590 (2012) - [j25]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. 414(1): 9-19 (2012) - [j24]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. 420: 28-35 (2012) - [j23]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. Theor. Comput. Sci. 423: 1-10 (2012) - [j22]Petr A. Golovach, Daniël Paulusma, Jian Song:
Computing vertex-surjective homomorphisms to partially reflexive trees. Theor. Comput. Sci. 457: 86-100 (2012) - [c55]Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding Vertex-Surjective Graph Homomorphisms. CSR 2012: 160-171 - [c54]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. ESA 2012: 515-526 - [c53]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. ICALP (2) 2012: 525-536 - [c52]Petr A. Golovach, Daniël Paulusma, Jian Song:
Closing Complexity Gaps for Coloring Problems on H-Free Graphs. ISAAC 2012: 14-23 - [c51]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Detecting Induced Minors in AT-Free Graphs. ISAAC 2012: 495-505 - [c50]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei:
An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. IPEC 2012: 85-96 - [c49]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. LATIN 2012: 350-361 - [c48]Petr A. Golovach, Daniël Paulusma, Bernard Ries:
Coloring Graphs Characterized by a Forbidden Subgraph. MFCS 2012: 443-454 - [c47]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges. MFCS 2012: 455-466 - [c46]Petr A. Golovach, Daniël Paulusma, Jian Song:
4-Coloring H-Free Graphs When H Is Small. SOFSEM 2012: 289-300 - [c45]Fedor V. Fomin, Petr A. Golovach:
Parameterized Complexity of Connected Even/Odd Subgraph Problems. STACS 2012: 432-440 - [c44]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-Free Graphs. SWAT 2012: 153-164 - [c43]Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
Solutions for the Stable Roommates Problem with Payments. WG 2012: 69-80 - [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 - [i7]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. CoRR abs/1202.4419 (2012) - [i6]Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding vertex-surjective graph homomorphisms. CoRR abs/1204.2124 (2012) - [i5]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges. CoRR abs/1204.5113 (2012) - [i4]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger:
Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay. CoRR abs/1208.5345 (2012) - 2011
- [j21]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica 61(2): 252-273 (2011) - [j20]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer:
How to Guard a Graph? Algorithmica 61(4): 839-856 (2011) - [j19]Petr A. Golovach, Dimitrios M. Thilikos:
Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discret. Optim. 8(1): 72-86 (2011) - [j18]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Lift Contractions. Electron. Notes Discret. Math. 38: 407-412 (2011) - [j17]Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen:
Spanners of bounded degree graphs. Inf. Process. Lett. 111(3): 142-144 (2011) - [j16]Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6): 1108-1119 (2011) - [j15]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction obstructions for treewidth. J. Comb. Theory B 101(5): 302-314 (2011) - [j14]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximating Width Parameters of Hypergraphs with Excluded Minors. SIAM J. Discret. Math. 25(3): 1331-1348 (2011) - [j13]Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. 412(8-10): 846-852 (2011) - [j12]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412(23): 2513-2523 (2011) - [j11]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. 412(46): 6484-6497 (2011) - [j10]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-free graphs. Theor. Comput. Sci. 412(50): 7001-7008 (2011) - [c41]Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos:
Odd cyclic surface separators in planar graphs. CTW 2011: 165-167 - [c40]Petr A. Golovach, Daniël Paulusma, Jian Song:
Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. CSR 2011: 261-274 - [c39]Petr A. Golovach, Daniël Paulusma, Jian Song:
Coloring Graphs without Short Cycles and Long Induced Paths. FCT 2011: 193-204 - [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 - [c37]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Increasing the Minimum Degree of a Graph by Contractions. IPEC 2011: 67-79 - [c36]Hajo Broersma, Petr A. Golovach, Viresh Patel:
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC 2011: 207-218 - [c35]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma:
Contracting a Chordal Graph to a Split Graph or a Tree. MFCS 2011: 339-350 - [c34]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. WG 2011: 119-130 - [i3]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. CoRR abs/1112.3244 (2011) - 2010
- [j9]Jirí Fiala, Petr A. Golovach:
Complexity of the packing coloring problem for trees. Discret. Appl. Math. 158(7): 771-778 (2010) - [j8]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh:
Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110(16): 702-706 (2010) - [j7]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010) - [j6]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan:
Pursuing a fast robber on a graph. Theor. Comput. Sci. 411(7-9): 1167-1181 (2010) - [c33]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167 - [c32]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA 2010: 493-502 - [c31]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Cops and Robber Game without Recharging. SWAT 2010: 273-284 - [c30]Petr A. Golovach, Bernard Lidický, Daniël Paulusma:
L(2, 1, 1)-Labeling Is NP-Complete for Trees. TAMC 2010: 211-221 - [c29]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximation Algorithms for Domination Search. WAOA 2010: 130-141 - [c28]Petr A. Golovach, Dieter Kratsch, Jean-François Couturier:
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. WG 2010: 39-50 - [c27]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. WG 2010: 63-74
2000 – 2009
- 2009
- [j5]Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl:
The capture time of a graph. Discret. Math. 309(18): 5588-5595 (2009) - [j4]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14): 795-798 (2009) - [c26]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717 - [c25]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009: 514-523 - [c24]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-Free Graphs. ISAAC 2009: 573-582 - [c23]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104 - [c22]Petr A. Golovach, Dimitrios M. Thilikos:
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. IWPEC 2009: 210-221 - [c21]Petr A. Golovach, Pinar Heggernes:
Choosability of P5-Free Graphs. MFCS 2009: 382-391 - [c20]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Clique-width: on the price of generality. SODA 2009: 825-834 - [c19]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456 - [c18]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230 - [c17]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Guard Games on Graphs: Keep the Intruder Out! WAOA 2009: 147-158 - [c16]Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý:
Parameterized Complexity of Generalized Domination Problems. WG 2009: 133-142 - [i2]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction Bidimensionality: the Accurate Picture. Parameterized complexity and approximation algorithms 2009 - 2008
- [c15]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) 2008: 294-305 - [c14]Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
Spanners in Sparse Graphs. ICALP (1) 2008: 597-608 - [c13]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl:
On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185 - [c12]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer:
How to Guard a Graph?. ISAAC 2008: 318-329 - [c11]Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS 2008: 290-298 - [c10]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Distance Constrained Labelings of Trees. TAMC 2008: 125-135 - [c9]Petr A. Golovach, Jan Kratochvíl:
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. TAMC 2008: 182-191 - [c8]Jirí Fiala, Petr A. Golovach:
Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145 - [c7]Petr A. Golovach, Yngve Villanger:
Parameterized Complexity for Domination Problems on Degenerate Graphs. WG 2008: 195-205 - [i1]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximating acyclicity parameters of sparse hypergraphs. CoRR abs/0809.3646 (2008) - 2007
- [j3]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone colorings for graphs: Tree and path backbones. J. Graph Theory 55(2): 137-152 (2007) - [c6]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518 - [c5]Petr A. Golovach, Jan Kratochvíl:
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG 2007: 1-11 - 2005
- [c4]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372 - 2004
- [c3]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67 - 2003
- [j2]Fedor V. Fomin, Petr A. Golovach:
Interval degree and bandwidth of a graph. Discret. Appl. Math. 129(2-3): 345-359 (2003) - [c2]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone Colorings for Networks. WG 2003: 131-142 - 2000
- [j1]Fedor V. Fomin, Petr A. Golovach:
Graph Searching and Interval Completion. SIAM J. Discret. Math. 13(4): 454-464 (2000)
1990 – 1999
- 1998
- [c1]Fedor V. Fomin, Petr A. Golovach:
Interval Completion with the Smallest Max-degree. WG 1998: 359-371
Coauthor Index
[j139] [j138] [j137] [j136] [j135] [j134] [j133] [c165] [c164] [c163] [c162] [c161] [c159] [c158] [i102] [i101] [i100] [i99] [i98] [i97] [j132] [j131] [j130] [j129] [j128] [j127] [j124] [c156] [c154] [c153] [c152] [c151] [c150] [c149] [c148] [c146] [c145] [c144] [i96] [i95] [i94] [i93] [i92] [i90] [i89] [i88] [i87] [i86] [j123] [j117] [j114] [j113] [c143] [c142] [c140] [c139] [c138] [c137] [c136] [c135] [c134] [i85] [i84] [i83] [i82] [i81] [i79] [i78] [j112] [j111] [j110] [j109] [j108] [c133] [c132] [c130] [c129] [c128] [c127] [c125] [c124] [i76] [i75] [i74] [i73] [i71] [i69] [i68] [i67] [i66] [i65] [i64] [j107] [j105] [j103] [j101] [j100] [j99] [c122] [c121] [c120] [c119] [c118] [c117] [c116] [c114] [c110] [i63] [i62] [i61] [i60] [i58] [i57] [i54] [j95] [j94] [j93] [c109] [c108] [c107] [c106] [c103] [c102] [i53] [i52] [i51] [i50] [i49] [j86] [j85] [c101] [c100] [c98] [i46] [i44] [i43] [i42] [j84] [j77] [j75] [c94] [c92] [c91] [i38] [i37] [i36] [j70] [j68] [c86] [i33] [i31] [j59] [c84] [c82] [c77] [i28] [i27] [i26] [i25] [j48] [j46] [j45] [c75] [c73] [j41] [c67] [c64] [c63] [c59] [i15] [i14] [i13] [i12] [i10] [j33] [j27] [j26] [c53] [c49] [c45] [j21] [j20] [j17] [j16] [j15] [j14] [j13] [j11] [i3] [j8] [j7] [j6] [c32] [c31] [c29] [j4] [c26] [c23] [c20] [c19] [c17] [i2] [c14] [c13] [c12] [c11] [i1] [j3] [c6] [j2] [c2] [j1] [c1]
Marcin Kaminski 0001
aka: Marcin Jakub Kaminski
aka: Marcin Jakub Kaminski
[j119] [c126] [i77] [j104] [j98] [j96] [j92] [j91] [j90] [j89] [j88] [j87] [j83] [j73] [c96] [c90] [c89] [i39] [j72] [j71] [j69] [j66] [c87] [c85] [i32] [i30] [i29] [j64] [j62] [c81] [c80] [c78] [i22] [j51] [j47] [j39] [j36] [c66] [c62] [c57] [i9] [j28] [c51] [c50] [i4] [j21] [j10] [c34] [j8] [c28] [j4] [c24] [c6]
[j121] [j118] [j115] [c131] [c123] [i72] [i70] [i55] [j98] [j97] [j89] [j87] [j81] [j79] [j78] [j73] [c95] [c90] [i40] [i39] [j72] [j69] [j67] [j65] [c87] [c85] [i30] [i29] [j64] [j63] [j61] [j60] [j58] [c83] [i24] [j55] [j54] [j53] [j52] [j50] [j49] [j44] [j43] [c74] [c68] [i21] [i19] [i18] [j42] [j41] [j40] [j38] [j37] [j36] [c65] [c61] [c60] [c58] [c57] [c56] [i16] [i9] [j34] [j32] [j30] [j28] [j25] [j24] [j23] [j22] [c55] [c54] [c52] [c51] [c48] [c47] [c46] [c44] [c43] [c42] [i7] [i6] [i5] [j18] [c40] [c39] [c38] [c37] [c35] [c34] [c33] [c30] [c27] [c25] [c23]
[j136] [c165] [c163] [c160] [c158] [i100] [i99] [i98] [j128] [c156] [i89] [j123] [c141] [c137] [c134] [i85] [i81] [i78] [j108] [c132] [c127] [i76] [i68] [j100] [j99] [c117] [c114] [c113] [j95] [j94] [j93] [c109] [c107] [i53] [i52] [j86] [c99] [i42] [j84] [c94] [c91] [i36] [c86] [i31] [c84] [i27] [j46] [c75] [c73] [j10] [j8] [j7] [c32] [c24] [c20]
[j130] [j126] [j125] [c152] [c147] [j114] [j113] [i80] [c130] [c124] [i75] [i74] [i69] [i65] [j107] [j101] [c118] [c111] [c104] [c103] [i48] [j85] [c98] [i45] [i44] [i43] [j79] [j76] [c92] [i38] [c83] [c79] [i24] [i23] [j50] [c76] [i17] [j37] [j32] [j24] [j19] [j18] [j15] [j14] [c41] [c37] [c29] [c26] [c25] [c22] [c19] [i2] [i1]
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-11-07 20:35 CET 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:
