Your search returned the following 7 documents:

7. A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
   Khaled Elbassioni
   In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 513-524
   
6. Certifying 3-Connectivity in Linear Time
   Jens M. Schmidt
   In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 786-797
   
5. Clique Cover and Graph Separation: New Incompressibility Results
   Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Magnus Wahlström
   In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 254-265
   
4. Counting Arbitrary Subgraphs in Data Streams
   Daniel Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun
   In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 598-609
   
3. Efficient Sampling Methods for Discrete Distributions
   Karl Bringmann and Konstantinos Panagiotou
   In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 133-144
   
   
2. Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
   Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Magnus Wahlström
   In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 581-593
   
1. The Power of Recourse for Online MST and TSP
   Nicole Megow, Martin Skutella, Jose Verschae, and Andreas Wiese
   In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, 2012, 689-700