default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIPEC 2015: Patras, Greece
- Thore Husfeldt, Iyad A. Kanj:
10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16-18, 2015, Patras, Greece. LIPIcs 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-92-7 - Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors. i-xiv
- Dimitrios M. Thilikos:
Bidimensionality and Parameterized Algorithms (Invited Talk). 1-16 - Virginia Vassilevska Williams:
Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk). 17-29 - Petr A. Golovach
, Clément Requilé, Dimitrios M. Thilikos:
Variants of Plane Diameter Completion. 30-42 - Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. 43-54 - Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger:
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. 55-65 - Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
On the Workflow Satisfiability Problem with Class-independent Constraints. 66-77 - Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. 78-89 - Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. 90-101 - Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. 102-113 - Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using Well-structured Modulators. 114-126 - Hubie Chen:
Parameter Compilation. 127-137 - Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. 138-150 - Ondrej Suchý:
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. 151-162 - Bart M. P. Jansen, Astrid Pieterse:
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. 163-174 - Lars Jaffke, Hans L. Bodlaender:
Definability Equals Recognizability for k-Outerplanar Graphs. 175-186 - Chiel B. Ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender:
Practical Algorithms for Linear Boolean-width. 187-198 - Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. 199-211 - Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle:
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. 212-223 - Max Bannach, Christoph Stockhusen, Till Tantau:
Fast Parallel Fixed-parameter Algorithms via Color Coding. 224-235 - Jannis Bulian, Anuj Dawar:
Fixed-parameter Tractable Distances to Sparse Graph Classes. 236-247 - Ilario Bonacina, Navid Talebanfard:
Strong ETH and Resolution via Games and the Multiplicity of Strategies. 248-257 - Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Quick but Odd Growth of Cacti. 258-269 - Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Block Graph Deletion. 270-281 - Tom C. van der Zanden:
Parameterized Complexity of Graph Constraint Logic. 282-293 - Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. 294-306 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. 307-318 - Edouard Bonnet, Florian Sikora:
The Graph Motif Problem Parameterized by the Structure of the Input Graph. 319-330 - Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh:
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. 331-342 - Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon:
Parameterized Complexity of Critical Node Cuts. 343-354 - Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Parameterized Complexity of Sparse Linear Complementarity Problems. 355-364 - R. B. Sandeep, Naveen Sivadasan:
Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion. 365-376 - Stefan Kratsch, Manuel Sorge:
On Kernelization and Approximation for the Vector Connectivity Problem. 377-388 - Fahad Panolan, Geevarghese Philip, Saket Saurabh:
B-Chromatic Number: Beyond NP-Hardness. 389-401 - Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar:
Fast Biclustering by Dual Parameterization. 402-413
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.
last updated on 2025-01-16 21:50 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:
