10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Proceedings{husfeldt_et_al:LIPIcs.IPEC.2015, title = {{LIPIcs, Volume 43, IPEC'15, Complete Volume}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015}, URN = {urn:nbn:de:0030-drops-56020}, doi = {10.4230/LIPIcs.IPEC.2015}, annote = {Keywords: Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Discrete Mathematics} }
10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. i-xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{husfeldt_et_al:LIPIcs.IPEC.2015.i, author = {Husfeldt, Thore and Kanj, Iyad}, title = {{Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {i--xiv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.i}, URN = {urn:nbn:de:0030-drops-55676}, doi = {10.4230/LIPIcs.IPEC.2015.i}, annote = {Keywords: IPEC} }
Dimitrios M. Thilikos. Bidimensionality and Parameterized Algorithms (Invited Talk). In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{thilikos:LIPIcs.IPEC.2015.1, author = {Thilikos, Dimitrios M.}, title = {{Bidimensionality and Parameterized Algorithms}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {1--16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.1}, URN = {urn:nbn:de:0030-drops-55663}, doi = {10.4230/LIPIcs.IPEC.2015.1}, annote = {Keywords: Parameterized algorithms, Subexponential FPT-algorithms, Kernelization, Linear kenrels, Bidimensionality, Graph Minors} }
Virginia Vassilevska Williams. Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk). In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 17-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{vassilevskawilliams:LIPIcs.IPEC.2015.17, author = {Vassilevska Williams, Virginia}, title = {{Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {17--29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.17}, URN = {urn:nbn:de:0030-drops-55683}, doi = {10.4230/LIPIcs.IPEC.2015.17}, annote = {Keywords: reductions, satisfiability, strong exponential time hypothesis, shortest paths, 3SUM, equivalences, fine-grained complexity} }
Petr A. Golovach, Clément Requilé, and Dimitrios M. Thilikos. Variants of Plane Diameter Completion. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 30-42, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{golovach_et_al:LIPIcs.IPEC.2015.30, author = {Golovach, Petr A. and Requil\'{e}, Cl\'{e}ment and Thilikos, Dimitrios M.}, title = {{Variants of Plane Diameter Completion}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {30--42}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.30}, URN = {urn:nbn:de:0030-drops-55697}, doi = {10.4230/LIPIcs.IPEC.2015.30}, annote = {Keywords: Planar graphs, graph modification problems, parameterized algorithms, dynamic programming, branchwidth} }
Florian Barbero, Gregory Gutin, Mark Jones, and Bin Sheng. Parameterized and Approximation Algorithms for the Load Coloring Problem. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 43-54, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{barbero_et_al:LIPIcs.IPEC.2015.43, author = {Barbero, Florian and Gutin, Gregory and Jones, Mark and Sheng, Bin}, title = {{Parameterized and Approximation Algorithms for the Load Coloring Problem}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {43--54}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.43}, URN = {urn:nbn:de:0030-drops-55703}, doi = {10.4230/LIPIcs.IPEC.2015.43}, annote = {Keywords: Load Coloring, fixed-parameter tractability, kernelization} }
Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, and Gerhard Woeginger. Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 55-65, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hermelin_et_al:LIPIcs.IPEC.2015.55, author = {Hermelin, Danny and Kubitza, Judith-Madeleine and Shabtay, Dvir and Talmon, Nimrod and Woeginger, Gerhard}, title = {{Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {55--65}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.55}, URN = {urn:nbn:de:0030-drops-55713}, doi = {10.4230/LIPIcs.IPEC.2015.55}, annote = {Keywords: Parameterized Complexity, Multiagent Scheduling} }
Jason Crampton, Andrei Gagarin, Gregory Gutin, and Mark Jones. On the Workflow Satisfiability Problem with Class-independent Constraints. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 66-77, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{crampton_et_al:LIPIcs.IPEC.2015.66, author = {Crampton, Jason and Gagarin, Andrei and Gutin, Gregory and Jones, Mark}, title = {{On the Workflow Satisfiability Problem with Class-independent Constraints}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {66--77}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.66}, URN = {urn:nbn:de:0030-drops-55727}, doi = {10.4230/LIPIcs.IPEC.2015.66}, annote = {Keywords: Workflow Satisfiability Problem; Constraint Satisfaction Problem; fixed-parameter tractability; user-independent constraints} }
Eun Jung Kim, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos. Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 78-89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kim_et_al:LIPIcs.IPEC.2015.78, author = {Kim, Eun Jung and Paul, Christophe and Sau, Ignasi and Thilikos, Dimitrios M.}, title = {{Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {78--89}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.78}, URN = {urn:nbn:de:0030-drops-55738}, doi = {10.4230/LIPIcs.IPEC.2015.78}, annote = {Keywords: Parameterized complexity, Fixed-Parameter Tractable algorithm, Multiway Cut, Digraph homomorphism} }
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, and Junichi Teruyama. Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 90-101, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{sakai_et_al:LIPIcs.IPEC.2015.90, author = {Sakai, Takayuki and Seto, Kazuhisa and Tamaki, Suguru and Teruyama, Junichi}, title = {{Improved Exact Algorithms for Mildly Sparse Instances of Max SAT}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {90--101}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.90}, URN = {urn:nbn:de:0030-drops-55747}, doi = {10.4230/LIPIcs.IPEC.2015.90}, annote = {Keywords: maximum satisfiability, weighted, polynomial space, exponential space} }
Archontia C. Giannopoulou, George B. Mertzios, and Rolf Niedermeier. Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 102-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{giannopoulou_et_al:LIPIcs.IPEC.2015.102, author = {Giannopoulou, Archontia C. and Mertzios, George B. and Niedermeier, Rolf}, title = {{Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {102--113}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.102}, URN = {urn:nbn:de:0030-drops-55750}, doi = {10.4230/LIPIcs.IPEC.2015.102}, annote = {Keywords: fixed-parameter algorithm, preprocessing, data reduction, polynomial-time algorithm, longest path problem, interval graphs, proper interval vertex del} }
Eduard Eiben, Robert Ganian, and Stefan Szeider. Meta-kernelization using Well-structured Modulators. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 114-126, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{eiben_et_al:LIPIcs.IPEC.2015.114, author = {Eiben, Eduard and Ganian, Robert and Szeider, Stefan}, title = {{Meta-kernelization using Well-structured Modulators}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {114--126}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.114}, URN = {urn:nbn:de:0030-drops-55769}, doi = {10.4230/LIPIcs.IPEC.2015.114}, annote = {Keywords: Kernelization, Parameterized complexity, Structural parameters, Rank-width, Split decompositions} }
Hubie Chen. Parameter Compilation. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 127-137, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{chen:LIPIcs.IPEC.2015.127, author = {Chen, Hubie}, title = {{Parameter Compilation}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {127--137}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.127}, URN = {urn:nbn:de:0030-drops-55771}, doi = {10.4230/LIPIcs.IPEC.2015.127}, annote = {Keywords: compilation, parameterized complexity} }
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, and Christophe Paul. An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 138-150, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kante_et_al:LIPIcs.IPEC.2015.138, author = {Kant\'{e}, Mamadou Moustapha and Kim, Eun Jung and Kwon, O-joung and Paul, Christophe}, title = {{An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {138--150}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.138}, URN = {urn:nbn:de:0030-drops-55788}, doi = {10.4230/LIPIcs.IPEC.2015.138}, annote = {Keywords: (linear) rankwidth, distance-hereditary graphs, thread graphs, parameterized complexity, kernelization} }
Ondrj Suchý. Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 151-162, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{suchy:LIPIcs.IPEC.2015.151, author = {Such\'{y}, Ondrj}, title = {{Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {151--162}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.151}, URN = {urn:nbn:de:0030-drops-55790}, doi = {10.4230/LIPIcs.IPEC.2015.151}, annote = {Keywords: Steiner Tree, polynomial kernel, planar graphs, polynomial-time preprocessing, network sparsification} }
Bart M. P. Jansen and Astrid Pieterse. Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 163-174, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2015.163, author = {Jansen, Bart M. P. and Pieterse, Astrid}, title = {{Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {163--174}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.163}, URN = {urn:nbn:de:0030-drops-55806}, doi = {10.4230/LIPIcs.IPEC.2015.163}, annote = {Keywords: sparsification, graph coloring, Hamiltonian cycle, satisfiability} }
Lars Jaffke and Hans L. Bodlaender. Definability Equals Recognizability for k-Outerplanar Graphs. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 175-186, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{jaffke_et_al:LIPIcs.IPEC.2015.175, author = {Jaffke, Lars and Bodlaender, Hans L.}, title = {{Definability Equals Recognizability for k-Outerplanar Graphs}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {175--186}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.175}, URN = {urn:nbn:de:0030-drops-55815}, doi = {10.4230/LIPIcs.IPEC.2015.175}, annote = {Keywords: treewidth, monadic second order logic of graphs, finite state tree automata, \$k\$-outerplanar graphs} }
Chiel B. ten Brinke, Frank J. P. van Houten, and Hans L. Bodlaender. Practical Algorithms for Linear Boolean-width. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 187-198, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{tenbrinke_et_al:LIPIcs.IPEC.2015.187, author = {ten Brinke, Chiel B. and van Houten, Frank J. P. and Bodlaender, Hans L.}, title = {{Practical Algorithms for Linear Boolean-width}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {187--198}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.187}, URN = {urn:nbn:de:0030-drops-55821}, doi = {10.4230/LIPIcs.IPEC.2015.187}, annote = {Keywords: graph decomposition, boolean-width, heuristics, exact algorithms, vertex subset problems} }
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, and Arkadiusz Socala. Linear Kernels for Outbranching Problems in Sparse Digraphs. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 199-211, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bonamy_et_al:LIPIcs.IPEC.2015.199, author = {Bonamy, Marthe and Kowalik, Lukasz and Pilipczuk, Michal and Socala, Arkadiusz}, title = {{Linear Kernels for Outbranching Problems in Sparse Digraphs}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {199--211}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.199}, URN = {urn:nbn:de:0030-drops-55839}, doi = {10.4230/LIPIcs.IPEC.2015.199}, annote = {Keywords: FPT algorithm, kernelization, outbranching, sparse graphs} }
Jisu Jeong, Sigve Hortemo Sæther, and Jan Arne Telle. Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 212-223, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{jeong_et_al:LIPIcs.IPEC.2015.212, author = {Jeong, Jisu and S{\ae}ther, Sigve Hortemo and Telle, Jan Arne}, title = {{Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {212--223}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.212}, URN = {urn:nbn:de:0030-drops-55846}, doi = {10.4230/LIPIcs.IPEC.2015.212}, annote = {Keywords: FPT algorithms, treewidth, dominating set} }
Max Bannach, Christoph Stockhusen, and Till Tantau. Fast Parallel Fixed-parameter Algorithms via Color Coding. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 224-235, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bannach_et_al:LIPIcs.IPEC.2015.224, author = {Bannach, Max and Stockhusen, Christoph and Tantau, Till}, title = {{Fast Parallel Fixed-parameter Algorithms via Color Coding}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {224--235}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.224}, URN = {urn:nbn:de:0030-drops-55857}, doi = {10.4230/LIPIcs.IPEC.2015.224}, annote = {Keywords: color coding, parallel computation, fixed-parameter tractability, graph packing, cutting \$ell\$ vertices, cluster editing, tree-width, tree-depth,} }
Jannis Bulian and Anuj Dawar. Fixed-parameter Tractable Distances to Sparse Graph Classes. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 236-247, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bulian_et_al:LIPIcs.IPEC.2015.236, author = {Bulian, Jannis and Dawar, Anuj}, title = {{Fixed-parameter Tractable Distances to Sparse Graph Classes}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {236--247}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.236}, URN = {urn:nbn:de:0030-drops-55865}, doi = {10.4230/LIPIcs.IPEC.2015.236}, annote = {Keywords: parameterized complexity, fixed-parameter tractable, distance, graph theory, sparse graphs, graph minor, nowhere dense} }
Ilario Bonacina and Navid Talebanfard. Strong ETH and Resolution via Games and the Multiplicity of Strategies. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 248-257, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bonacina_et_al:LIPIcs.IPEC.2015.248, author = {Bonacina, Ilario and Talebanfard, Navid}, title = {{Strong ETH and Resolution via Games and the Multiplicity of Strategies}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {248--257}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.248}, URN = {urn:nbn:de:0030-drops-55876}, doi = {10.4230/LIPIcs.IPEC.2015.248}, annote = {Keywords: Strong Exponential Time Hypothesis, resolution, proof systems} }
Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh. Quick but Odd Growth of Cacti. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 258-269, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kolay_et_al:LIPIcs.IPEC.2015.258, author = {Kolay, Sudeshna and Lokshtanov, Daniel and Panolan, Fahad and Saurabh, Saket}, title = {{Quick but Odd Growth of Cacti}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {258--269}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.258}, URN = {urn:nbn:de:0030-drops-55883}, doi = {10.4230/LIPIcs.IPEC.2015.258}, annote = {Keywords: Even Cycle Transversal, Diamond Hitting Set, Randomized Algorithms} }
Eun Jung Kim and O-joung Kwon. A Polynomial Kernel for Block Graph Deletion. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 270-281, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kim_et_al:LIPIcs.IPEC.2015.270, author = {Kim, Eun Jung and Kwon, O-joung}, title = {{A Polynomial Kernel for Block Graph Deletion}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {270--281}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.270}, URN = {urn:nbn:de:0030-drops-55893}, doi = {10.4230/LIPIcs.IPEC.2015.270}, annote = {Keywords: block graph, polynomial kernel, single-exponential FPT algorithm} }
Tom C. van der Zanden. Parameterized Complexity of Graph Constraint Logic. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 282-293, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{vanderzanden:LIPIcs.IPEC.2015.282, author = {van der Zanden, Tom C.}, title = {{Parameterized Complexity of Graph Constraint Logic}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {282--293}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.282}, URN = {urn:nbn:de:0030-drops-55906}, doi = {10.4230/LIPIcs.IPEC.2015.282}, annote = {Keywords: Nondeterministic Constraint Logic, Reconfiguration Problems, Parameterized Complexity, Treewidth, Bandwidth} }
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Tobias Mömke. Complexity and Approximability of Parameterized MAX-CSPs. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 294-306, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{dell_et_al:LIPIcs.IPEC.2015.294, author = {Dell, Holger and Kim, Eun Jung and Lampis, Michael and Mitsou, Valia and M\"{o}mke, Tobias}, title = {{Complexity and Approximability of Parameterized MAX-CSPs}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {294--306}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.294}, URN = {urn:nbn:de:0030-drops-55910}, doi = {10.4230/LIPIcs.IPEC.2015.294}, annote = {Keywords: Approximation, Structural Parameters, Constraint Satisfaction} }
Petr A. Golovach, Pinar Heggernes, and Dieter Kratsch. Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 307-318, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{golovach_et_al:LIPIcs.IPEC.2015.307, author = {Golovach, Petr A. and Heggernes, Pinar and Kratsch, Dieter}, title = {{Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {307--318}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.307}, URN = {urn:nbn:de:0030-drops-55925}, doi = {10.4230/LIPIcs.IPEC.2015.307}, annote = {Keywords: Minimal connected dominating set, exact algorithms, enumeration} }
Édouard Bonnet and Florian Sikora. The Graph Motif Problem Parameterized by the Structure of the Input Graph. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 319-330, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2015.319, author = {Bonnet, \'{E}douard and Sikora, Florian}, title = {{The Graph Motif Problem Parameterized by the Structure of the Input Graph}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {319--330}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.319}, URN = {urn:nbn:de:0030-drops-55937}, doi = {10.4230/LIPIcs.IPEC.2015.319}, annote = {Keywords: Parameterized Complexity, Structural Parameters, Graph Motif, Computational Biology} }
Diptapriyo Majumdar, Venkatesh Raman, and Saket Saurabh. Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 331-342, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{majumdar_et_al:LIPIcs.IPEC.2015.331, author = {Majumdar, Diptapriyo and Raman, Venkatesh and Saurabh, Saket}, title = {{Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {331--342}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.331}, URN = {urn:nbn:de:0030-drops-55943}, doi = {10.4230/LIPIcs.IPEC.2015.331}, annote = {Keywords: Parameterized Complexity, Kernelization, expansion lemma, vertex cover, structural parameterization} }
Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, and Barak Navon. Parameterized Complexity of Critical Node Cuts. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 343-354, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hermelin_et_al:LIPIcs.IPEC.2015.343, author = {Hermelin, Danny and Kaspi, Moshe and Komusiewicz, Christian and Navon, Barak}, title = {{Parameterized Complexity of Critical Node Cuts}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {343--354}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.343}, URN = {urn:nbn:de:0030-drops-55950}, doi = {10.4230/LIPIcs.IPEC.2015.343}, annote = {Keywords: graph cut problem, NP-hard problem, treewidth} }
Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino. Parameterized Complexity of Sparse Linear Complementarity Problems. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 355-364, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{sumita_et_al:LIPIcs.IPEC.2015.355, author = {Sumita, Hanna and Kakimura, Naonori and Makino, Kazuhisa}, title = {{Parameterized Complexity of Sparse Linear Complementarity Problems}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {355--364}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.355}, URN = {urn:nbn:de:0030-drops-55962}, doi = {10.4230/LIPIcs.IPEC.2015.355}, annote = {Keywords: linear complementarity problem, sparsity, parameterized complexity} }
R. B. Sandeep and Naveen Sivadasan. Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 365-376, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{sandeep_et_al:LIPIcs.IPEC.2015.365, author = {Sandeep, R. B. and Sivadasan, Naveen}, title = {{Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {365--376}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.365}, URN = {urn:nbn:de:0030-drops-55976}, doi = {10.4230/LIPIcs.IPEC.2015.365}, annote = {Keywords: edge deletion problems, polynomial kernelization} }
Stefan Kratsch and Manuel Sorge. On Kernelization and Approximation for the Vector Connectivity Problem. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 377-388, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kratsch_et_al:LIPIcs.IPEC.2015.377, author = {Kratsch, Stefan and Sorge, Manuel}, title = {{On Kernelization and Approximation for the Vector Connectivity Problem}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {377--388}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.377}, URN = {urn:nbn:de:0030-drops-55985}, doi = {10.4230/LIPIcs.IPEC.2015.377}, annote = {Keywords: parameterized complexity, kernelization, approximation} }
Fahad Panolan, Geevarghese Philip, and Saket Saurabh. B-Chromatic Number: Beyond NP-Hardness. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 389-401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{panolan_et_al:LIPIcs.IPEC.2015.389, author = {Panolan, Fahad and Philip, Geevarghese and Saurabh, Saket}, title = {{B-Chromatic Number: Beyond NP-Hardness}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {389--401}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.389}, URN = {urn:nbn:de:0030-drops-55997}, doi = {10.4230/LIPIcs.IPEC.2015.389}, annote = {Keywords: b-chromatic number, exact algorithm, parameterized complexity} }
Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, and Somnath Sikdar. Fast Biclustering by Dual Parameterization. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 402-413, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{drange_et_al:LIPIcs.IPEC.2015.402, author = {Drange, P\r{a}l Gr{\o}n\r{a}s and Reidl, Felix and S\'{a}nchez Villaamil, Fernando and Sikdar, Somnath}, title = {{Fast Biclustering by Dual Parameterization}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {402--413}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.402}, URN = {urn:nbn:de:0030-drops-56004}, doi = {10.4230/LIPIcs.IPEC.2015.402}, annote = {Keywords: graph editing, subexponential algorithms, parameterized complexity} }
Feedback for Dagstuhl Publishing