FOCS 2005 - PDF Preprint Papers

FOCS 2005 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2005 Paper

click to vote

FOCS
2005
IEEE

219views Theoretical Computer Science» more FOCS 2005»

Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring

13 years 5 months ago

Download www-math.mit.edu

At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a ﬁxed minor. This result is ...

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...

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	219	Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring	claim
2	153	The Closest Substring problem with small distances	claim
3	153	Concurrent Non-Malleable Commitments	claim
4	145	The Complexity of Online Memory Checking	claim
5	140	How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems	claim
6	128	A Characterization of the (natural) Graph Properties Testable with One-Sided Error	claim
7	123	Sampling-based Approximation Algorithms for Multi-stage Stochastic	claim
8	122	Group-theoretic Algorithms for Matrix Multiplication	claim
9	120	Cryptography In the Bounded Quantum-Storage Model	claim
10	114	Metric Embeddings with Relaxed Guarantees	claim
11	114	Truthful and Near-Optimal Mechanism Design via Linear Programming	claim
12	108	An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs	claim
13	108	AdWords and Generalized On-line Matching	claim
14	106	Hardness of Approximating the Closest Vector Problem with Pre-Processing	claim
15	104	Mechanism Design via Machine Learning	claim
16	104	Learning mixtures of product distributions over discrete domains	claim
17	104	Approximation Algorithms for Unique Games	claim
18	100	Lower Bounds for the Noisy Broadcast Problem	claim
19	100	Beyond VCG: Frugality of Truthful Mechanisms	claim
20	99	Towards a Final Analysis of Pairing Heaps	claim
21	97	On the Complexity of Real Functions	claim
22	96	On the Impossibility of Obfuscation with Auxiliary Input	claim
23	96	Safraless Decision Procedures	claim
24	94	Agnostically Learning Halfspaces	claim
25	93	On Non-Approximability for Quadratic Programs	claim
26	91	Additive Approximation for Edge-Deletion Problems	claim
27	90	Linear Lower Bounds on Real-World Implementations of Concurrent Objects	claim
28	83	Error Correction via Linear Programming	claim
29	83	Nonembeddability theorems via Fourier analysis	claim
30	83	Approximation Algorithms for Scheduling on Multiple Machines	claim
31	82	On Learning Mixtures of Heavy-Tailed Distributions	claim
32	81	The Parking Permit Problem	claim
33	79	Quantum Information and the PCP Theorem	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers