Table Of ContentLecture Notes in Computer Science 5917
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
MadhuSudan
MicrosoftResearch,Cambridge,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
Max-PlanckInstituteofComputerScience,Saarbruecken,Germany
Jianer Chen Fedor V. Fomin (Eds.)
Parameterized and
Exact Computation
4th International Workshop, IWPEC 2009
Copenhagen, Denmark, September 10-11, 2009
Revised Selected Papers
1 3
VolumeEditors
JianerChen
TexasA&MUniversity
DepartmentofComputerScienceandEngineering
CollegeStation,Texas77843,USA
E-mail:[email protected]
FedorV.Fomin
UniversitetetiBergen
Instituttforinformatikk
Postboks7803
5020Bergen,Norway
E-mail:[email protected]
LibraryofCongressControlNumber:2009941300
CRSubjectClassification(1998):B.2.4,F.2,G.1,G.2,G.4,I.1,E.1,I.2.8
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
ISSN 0302-9743
ISBN-10 3-642-11268-4SpringerBerlinHeidelbergNewYork
ISBN-13 978-3-642-11268-3SpringerBerlinHeidelbergNewYork
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable
toprosecutionundertheGermanCopyrightLaw.
springer.com
©Springer-VerlagBerlinHeidelberg2009
PrintedinGermany
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper SPIN:12823598 06/3180 543210
Preface
The Workshop on Parameterized and Exact Computation (IWPEC) is an in-
ternational workshop series that covers research in all aspects of parameterized
and exact algorithms and complexity, and especially encourages the study of
parameterizedand exact computations for real-worldapplications and algorith-
mic engineering. The goal of the workshop is to present recent research results,
including significantwork-in-progress,and to identify and explore directions for
future research.
IWPEC2009wasthefourthworkshopintheseries,heldinCopenhagen,Den-
mark, during September 10-11, 2009. The workshop was part of ALGO 2009,
which also hosted the 17th European Symposium on Algorithms (ESA 2009),
the 9th Workshop on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems (ATMOS 2009), and the 7th Workshop on Approx-
imation and Online Algorithms (WAOA 2009). Three previous meetings of the
IWPEC series were held in Bergen, Norway, 2004, Zu¨rich, Switzerland, 2006,
and Victoria, Canada, 2008.
AtIWPEC2009,wehadtwoplenaryspeakers,NogaAlon(TelAviv Univer-
sity,Israel)andHans Bodlaender (UtrechtUniversity,The Netherlands), giving
50-minutetalkseach.ProfessorAlonspokeon“ColorCoding,BalancedHashing
andApproximateCounting,”andProfessorBodlaenderon“Kernelization:New
Upper andLowerBound Techniques.”Their respective abstractsaccompanying
the talks are included in these proceedings.
InresponsetotheCallforPapers,52papersweresubmitted.Eachsubmission
was reviewed by at least three reviewers (most by at least four). The reviewers
were either Program Committee members or invited external reviewers. The
ProgramCommittee heldelectronicmeetings using the EasyChairsystem,went
throughthoroughdiscussions,andselected25ofthesubmissionsforpresentation
at the workshop and inclusion in this LNCS volume.
We are very grateful to the ProgramCommittee, and the external reviewers
theycalledon,forthehardworkandexpertisewhichtheybroughttothedifficult
selection process. We also wish to thank all the authors who submitted their
work for our consideration. Special thanks go to Thore Husfeldt for the local
organizationof the ALGO 2009 conference in Copenhagen.
Finally,wewouldliketothankthemembersoftheEditorialBoardofLecture
Notes in Computer ScienceandtheEditorsatSpringerfortheir encouragement
and cooperation throughout the preparation of these proceedings.
November 2009 Jianer Chen
Fedor Fomin
Organization
IWPEC 2009 Program Committee
Faisal Abu-Khzam Beirut, Lebanon
Hans Bodlaender Utrecht, The Netherlands
Jonathan Buss Waterloo, Canada
Leizhen Cai Hong Kong, China
Liming Cai Georgia, USA
Jianer Chen College Station, USA (Co-chair)
Michael Fellows Newcastle, Australia
Henning Fernau Trier, Germany
J¨org Flum Freiburg, Germany
Fedor Fomin Bergen, Norway, (Co-chair)
Jiong Guo Jena, Germany
Edward A. Hirsch St. Petersburg,Russia
Thore Husfeldt Copenhagen, Denmark
Iyad Kanj Chicago, USA
D´aniel Marx Budapest, Hungary
Catherine McCartin Wellington, New Zealand
Igor Razgon Cork, Ireland
Saket Saurabh Bergen, Norway
Uwe Sch¨oning Ulm, Germany
Stefan Szeider Durham, UK
Dimitrios Thilikos Athens, Greece
Mark Weyer Berlin, Germany
IWPEC Steering Committee
Jianer Chen College Station, USA
Frank Dehne Ottawa, Canada
Rod Downey Wellington, New Zealand
Michael Fellows Newcastle, Australia
Mike Langston Knoxville, USA
Rolf Niedermeier Jena, Germany
Venkatesh Raman Chennai, India
VIII Organization
External Reviewers
Adler, Isolde Lampis, Michael
Antipov, Dmitry Liedloff, Mathieu
Betzler, Nadja Liers, Frauke
Chandrasekaran,Venkat Liu, Yang
Chen, Xi Lokshtanov, Daniel
Chen, Yijia Mathieson, Luke
Daligault, Jean Meister, Daniel
Dantchev, Stefan Mnich, Matthias
Dom, Michael Moser, Hannes
Dorn, Frederic Mouawad, Amer
Gao, Yong Mu¨ller, Moritz
Gaspers, Serge Naeher, Stefan
Giannopoulou, Archontia Nederlof, Jesper
Gravin, Nikolai Ordyniak, Sebastian
Gutner, Shai Paturi, Ramamohan
Hoang, Thanh Minh Pelsmajer, Michael
Hoogeveen, Han Penninkx, Eelko
Huang, Xiuzhen Philip, Geevarghese
Itsykson, Dmitry Raible, Daniel
Jansen, Bart Rossmanith, Peter
Kaminski, Marcin Schaefer, Marcus
Kant´e, Mamadou Moustapha Serna, Maria
Kim, Eun Jung Shareghi, Pooya
Knauer, Christian Todinca, Ioan
Kojevnikov,Arist Villanger, Yngve
Kratochvil, Jan Wagner, Fabian
Kratsch, Dieter Woltran, Stefan
Kreutzer, Stephan Xia, Ge
Krokhin, Andrei Yang, Lin
Kuegel, Adrian Zhang, Fenghui
Kulikov, Alexander van Rooij, Johan M.M.
Table of Contents
Balanced Hashing, Color Coding and Approximate Counting
(Invited Talk) ................................................... 1
Noga Alon and Shai Gutner
Kernelization: New Upper and Lower Bound Techniques
(Invited Talk) ................................................... 17
Hans L. Bodlaender
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams... 38
Sebastian B¨ocker, Falk Hu¨ffner, Anke Truss, and Magnus Wahlstro¨m
Planar Capacitated Dominating Set Is W[1]-Hard.................... 50
Hans L. Bodlaender, Daniel Lokshtanov, and Eelko Penninkx
Boolean-Width of Graphs......................................... 61
Binh-Minh Bui-Xuan, Jan Arne Telle, and Martin Vatshelle
The Complexity of Satisfiability of Small Depth Circuits .............. 75
Chris Calabro, Russell Impagliazzo, and Ramamohan Paturi
On Finding Directed Trees with Many Leaves ....................... 86
Jean Daligault and St´ephan Thomass´e
Bounded-Degree Techniques Accelerate Some Parameterized Graph
Algorithms...................................................... 98
Peter Damaschke
Pareto Complexity of Two-Parameter FPT Problems: A Case Study
for Partial Vertex Cover .......................................... 110
Peter Damaschke
What Makes Equitable Connected Partition Easy .................... 122
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad Kanj,
Frances Rosamond, and Ondˇrej Such´y
Improved Induced Matchings in Sparse Graphs ...................... 134
Rok Erman, L(cid:3)ukasz Kowalik, Matjaˇz Krnc, and Tomasz Walen´
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs ........ 149
Michael R. Fellows, Danny Hermelin, and Frances A. Rosamond
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.... 161
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer,
Mathieu Liedloff, Daniel Raible, and Peter Rossmanith
X Table of Contents
An Exponential Time 2-Approximation Algorithm for Bandwidth ...... 173
Martin Fu¨rer, Serge Gaspers, and Shiva Prasad Kasiviswanathan
On Digraph Width Measures in ParameterizedAlgorithmics........... 185
Robert Ganian, Petr Hlinˇen´y, Joachim Kneis, Alexander Langer,
Jan Obdrˇza´lek, and Peter Rossmanith
The Parameterized Complexity of Some Geometric Problems in
Unbounded Dimension............................................ 198
Panos Giannopoulos, Christian Knauer, and Gu¨nter Rote
Paths of Bounded Length and Their Cuts: Parameterized Complexity
and Algorithms.................................................. 210
Petr A. Golovach and Dimitrios M. Thilikos
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting
Networks in Linear Programs...................................... 222
Gregory Gutin, Daniel Karapetyan, and Igor Razgon
A Probabilistic Approach to Problems Parameterized above or below
Tight Bounds ................................................... 234
Gregory Gutin, Eun Jung Kim, Stefan Szeider, and Anders Yeo
Polynomial Kernels and Faster Algorithms for the Dominating Set
Problem on Graphs with an Excluded Minor ........................ 246
Shai Gutner
Partitioning into Sets of Bounded Cardinality ....................... 258
Mikko Koivisto
Two Edge Modification Problems without Polynomial Kernels ......... 264
Stefan Kratsch and Magnus Wahlstro¨m
On the Directed Degree-PreservingSpanning Tree Problem ........... 276
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, and
Somnath Sikdar
Even Faster Algorithm for Set Splitting! ......................... 288
Daniel Lokshtanov and Saket Saurabh
Stable Assignment with Couples: Parameterized Complexity and Local
Search.......................................................... 300
D´aniel Marx and Ildiko´ Schlotter
Improved Parameterized Algorithms for the Kemeny Aggregation
Problem ........................................................ 312
Narges Simjour
Computing Pathwidth Faster Than 2n ............................. 324
Karol Suchan and Yngve Villanger
Author Index.................................................. 337
Balanced Hashing, Color Coding and
Approximate Counting
Noga Alon1,(cid:2) and Shai Gutner2,(cid:2)(cid:2)
1 Schools of Mathematics and Computer Science, Tel-Aviv University,
Tel-Aviv,69978, Israel and IAS,Princeton, NJ, 08540, USA
[email protected]
2 School of Computer Science, Tel-Aviv University,Tel-Aviv,69978, Israel
[email protected]
Abstract. Color Coding is an algorithmic technique for deciding effi-
cientlyifagiveninputgraphcontainsapathofagivenlength(oranother
small subgraph of constant tree-width). Applications of the method in
computationalbiologymotivatethestudyofsimilaralgorithmsforcount-
ing the number of copies of a given subgraph. While it is unlikely that
exact counting of this type can be performed efficiently, as the problem
is#W[1]-completeevenforpaths,approximatecountingispossible,and
leads to the investigation of an intriguing variant of families of perfect
hashfunctions.Afamilyoffunctionsfrom[n]to[k]isan((cid:2),k)-balanced
family of hash functions, if there exists a positive T so that for every
K ⊂[n] of size |K|=k, the number of functions in the family that are
one-to-oneonK isbetween(1−(cid:2))T and(1+(cid:2))T.Thefamilyisperfectly
k-balanced if it is (0,k)-balanced.
We show that every such perfectly k-balanced family is of size at
least c(k)n(cid:2)k/2(cid:3), and that for every (cid:2) > 1 there are explicit con-
poly(k)
structions of ((cid:2),k)-balanced families of hash functions from [n] to [k] of
size e(1+o(1))klogn. This is tight up to the o(1)-term in the exponent,
andsuppliesdeterministicpolynomialtimealgorithmsforapproximately
countingthenumberofpathsorcyclesofaspecified lengthk (orcopies
ofanygraphH withkverticesandboundedtree-width)inagiveninput
graph of size n, up to relative error (cid:2), for all k≤O(logn).
Keywords: Approximate counting of subgraphs, color-coding, deran-
domization, expanders, perfect hashing, k-wise. independence.
1 Introduction
1.1 Motivation and Background
Color Coding is an algorithmic technique for deciding efficiently if a given in-
put graph contains a path or a cycle of a given length, or any other prescribed
(cid:2) ResearchsupportedinpartbyanERCAdvancedgrant,byaUSA-IsraelBSFgrant,
by NSFgrant CCF 0832797 and bythe AmbroseMonell Foundation.
(cid:2)(cid:2) ThispaperformspartofaPh.D.thesiswrittenbytheauthorunderthesupervision
of Prof. N. Alon and Prof. Y.Azar in Tel Aviv University.
J.ChenandF.V.Fomin(Eds.):IWPEC2009,LNCS5917,pp.1–16,2009.
(cid:2)c Springer-VerlagBerlinHeidelberg2009
