Thore Husfeldt

IPEC 2010 Accepts (with links)

with one comment

Here are the papers accepted at The Fifth International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13-15, 2010 at Chennai, India, with links to whatever electronic version I could find. Updates are welcome.

  • Robert Crowston, Gregory Gutin, Mark Jones and Anders Yeo. A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Application [arxiv 1004.0526]
  • Frederic Havet and Leonardo Sampaio. On the Grundy number of a graph
  • Robert Ganian, Petr Hlineny, Joachim Kneis, Daniel Meister, Jan Obdrzalek, Peter Rossmanith and Somnath Sikdar. Are there any good digraph width measures? [arxiv 1004.1485]
  • Daniel Binkele-Raible and Henning Fernau. Enumerate & Measure: Improving Parameter Budget Management
  • Chris Calabro, Impagliazzo Russell and Ramamohan Paturi. On the Exact Complexity of Evaluating Quantified k-CNF
  • Thore Husfeldt and Nina Taslaman. The exponential time complexity of computing the probability that a graph is connected [arxiv 1009.2362]
  • Britta Dorn and Ildikó Schlotter. Multivariate Complexity Analysis of Swap Bribery [PDF at Schlotter’s web page]
  • Katarína Cechlárová and Ildikó Schlotter. Computing the deficiency of housing markets with duplicate houses [PDF at Schlotter’s web page]
  • Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk and Jakub Wojtaszczyk. Improved FPT algorithm and quadratic kernel for Pathwidth One Vertex Deletion
  • Yixin Cao and Jianer Chen. Weighted Cluster Editing: Kernelization based on Edge-Cuts [arxiv 1008.4250]
  • Jesper Nederlof and Johan M. M. van Rooij. Inclusion/Exclusion Branching For Partial Dominating Set and Set Splitting
  • Nadja Betzler, Robert Bredereck and Rolf Niedermeier. Partial Kernelization for Rank Aggregation: Theory and Experiments [PDF at Betzler’s web page]
  • M. Praveen. Small Vertex Cover makes Petri Net Coverability and Boundedness Easier [arxiv 1009.2577]
  • Yngve Villanger. Proper Interval Vertex Deletion
  • Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider and Anders Yeo. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
  • Sylvain Guillemot, Christophe Paul and Anthony Perez. On the (non-)existence of polynomial kernels for Pl-free edge modification problems [arxiv 1007.4011]
  • Christian Hoffmann. Exponential Time Complexity of Weighted Counting of Independent Sets [arxiv 1007.1146]
  • Michael Fellows, Serge Gaspers and Frances Rosamond. Parameterizing by the Number of Numbers [arxiv 1007.2021]
  • M A Abhimanyu, B Radheshyam, Chintan Rao H, Venkata Koppula, Neeldhara Misra, Geevarghese Philip and Ramanujan M.S..On the Kernelization Complexity of Colorful Motifs
Advertisements

Written by thorehusfeldt

September 17, 2010 at 23:40

Posted in Uncategorized

One Response

Subscribe to comments with RSS.

  1. For the last paper in the list, you could use this link : http://www.imsc.res.in/~gphilip/publications/cm.pdf

    Regards,
    Philip

    G Philip

    October 15, 2010 at 19:39


Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: