ICALP 2007 - PDF Preprint Papers

ICALP 2007 International Colloquium on Automata

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICALP-2007 Paper

click to vote

ICALP
2007
Springer

295views Programming Languages» more ICALP 2007»

Linear Problem Kernels for NP-Hard Problems on Planar Graphs

14 years 6 months ago

Download theinf1.informatik.uni-jena.de

Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...

Jiong Guo, Rolf Niedermeier

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	295	Linear Problem Kernels for NP-Hard Problems on Planar Graphs	claim
2	209	Co-Logic Programming: Extending Logic Programming with Coinduction	claim
3	172	Complexity of Propositional Proofs Under a Promise	claim
4	162	On the Chromatic Number of Random Graphs	claim
5	162	Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems	claim
6	158	Unbounded-Error One-Way Classical and Quantum Communication Complexity	claim
7	153	In-Place Suffix Sorting	claim
8	152	Continuous Capacities on Continuous State Spaces	claim
9	141	Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity	claim
10	137	A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)	claim
11	133	Online Conflict-Free Colorings for Hypergraphs	claim
12	128	Mechanism Design for Fractional Scheduling on Unrelated Machines	claim
13	127	A "proof-reading" of Some Issues in Cryptography	claim
14	125	Parameterized Approximability of the Disjoint Cycle Problem	claim
15	125	Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization	claim
16	125	Estimating Sum by Weighted Sampling	claim
17	124	Modular Algorithms for Heterogeneous Modal Logics	claim
18	124	Perfect Information Stochastic Priority Games	claim
19	123	An Optimal Decomposition Algorithm for Tree Edit Distance	claim
20	123	A Combinatorial Theorem for Trees	claim
21	122	Reconciling Data Compression and Kolmogorov Complexity	claim
22	122	Constant-Round Private Database Queries	claim
23	122	Aliased Register Allocation for Straight-Line Programs Is NP-Complete	claim
24	120	Universal Algebra and Hardness Results for Constraint Satisfaction Problems	claim
25	117	Private Locally Decodable Codes	claim
26	117	Affine Systems of Equations and Counting Infinitary Logic	claim
27	116	Reachability-Time Games on Timed Automata	claim
28	113	Ring Signatures of Sub-linear Size Without Random Oracles	claim
29	113	On Commutativity Based Edge Lean Search	claim
30	112	A Fully Abstract Trace Semantics for General References	claim
31	111	Low Distortion Spanners	claim
32	111	Deterministic History-Independent Strategies for Storing Information on Write-Once Memories	claim
33	111	Holographic Algorithms: The Power of Dimensionality Resolved	claim
34	111	Checking and Spot-Checking the Correctness of Priority Queues	claim
35	105	Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions	claim
36	105	A Framework for Dynamizing Succinct Data Structures	claim
37	105	Conservative Ambiguity Detection in Context-Free Grammars	claim
38	103	Succinct Ordinal Trees Based on Tree Covering	claim
39	99	Strong Price of Anarchy for Machine Load Balancing	claim
40	99	Approximation by DNF: Examples and Counterexamples	claim
41	99	Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games	claim
42	98	Complexity of the Cover Polynomial	claim
43	97	Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners	claim
44	97	Unranked Tree Automata with Sibling Equalities and Disequalities	claim
45	96	Size Competitive Meshing Without Large Angles	claim
46	95	Exotic Quantifiers, Complexity Classes, and Complete Problems	claim
47	94	Categorical Views on Computations on Trees (Extended Abstract)	claim
48	94	Trading Static for Adaptive Security in Universally Composable Zero-Knowledge	claim
49	93	Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs	claim
50	93	Parameterized Algorithms for Directed Maximum Leaf Problems	claim
51	92	Labeling Schemes for Vertex Connectivity	claim
52	92	A Generalization of Cobham's Theorem to Automata over Real Numbers	claim
53	89	On the Power of k -Consistency	claim
54	88	Ready Simulation for Concurrency: It's Logical!	claim
55	87	Private Multiparty Sampling and Approximation of Vector Combinations	claim
56	86	Distributed Computing with Advice: Information Sensitivity of Graph Coloring	claim
57	85	Subexponential Parameterized Algorithms	claim
58	84	Bounded Depth Data Trees	claim
59	84	Minimum-Time Reachability in Timed Games	claim
60	83	Balanced Families of Perfect Hash Functions and Their Applications	claim
61	82	Unrestricted Aggregate Signatures	claim
62	82	Credentials-Based Authorization: Evaluation and Implementation	claim
63	81	Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms	claim
64	79	Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming	claim
65	76	Boundedness of Monadic FO over Acyclic Structures	claim
66	75	Model Theory Makes Formulas Large	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers