default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIPEC 2010: Chennai, India
- Venkatesh Raman, Saket Saurabh:
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6478, Springer 2010, ISBN 978-3-642-17492-6 - Anuj Dawar
:
The Complexity of Satisfaction on Sparse Graphs. 1-2 - Fedor V. Fomin:
Protrusions in Graphs and Their Applications. 3 - Toby Walsh:
Parameterized Complexity Results in Symmetry Breaking. 4-13 - Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan:
On the Kernelization Complexity of Colorful Motifs. 14-25 - Nadja Betzler, Robert Bredereck, Rolf Niedermeier:
Partial Kernelization for Rank Aggregation: Theory and Experiments. 26-37 - Daniel Binkele-Raible, Henning Fernau:
Enumerate and Measure: Improving Parameter Budget Management. 38-49 - Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k-CNF. 50-59 - Yixin Cao, Jianer Chen:
Cluster Editing: Kernelization Based on Edge Cuts. 60-71 - Katarína Cechlárová, Ildikó Schlotter:
Computing the Deficiency of Housing Markets with Duplicate Houses. 72-83 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application. 84-94 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion. 95-106 - Britta Dorn, Ildikó Schlotter:
Multivariate Complexity Analysis of Swap Bribery. 107-122 - Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Parameterizing by the Number of Numbers. 123-134 - Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are There Any Good Digraph Width Measures? 135-146 - Sylvain Guillemot, Christophe Paul, Anthony Perez:
On the (Non-)existence of Polynomial Kernels for Pl-free Edge Modification Problems. 147-157 - Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. 158-169 - Frédéric Havet, Leonardo Sampaio Rocha:
On the Grundy Number of a Graph. 170-179 - Christian Hoffmann:
Exponential Time Complexity of Weighted Counting of Independent Sets. 180-191 - Thore Husfeldt, Nina Taslaman:
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected. 192-203 - Jesper Nederlof, Johan M. M. van Rooij:
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting. 204-215 - M. Praveen:
Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier. 216-227 - Yngve Villanger:
Proper Interval Vertex Deletion. 228-238
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 2026-03-01 23:11 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:
