Conferences in DBLP
Noga Alon , Asaf Shapira , Benny Sudakov Additive Approximation for Edge-Deletion Problems (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grohe , Oleg Verbitsky Testing Graph Isomorphism in Parallel by Playing a Game. [Citation Graph (0, 0)][DBLP ] Conf ] Amin Coja-Oghlan , André Lanka The Spectral Gap of Random Graphs with Given Expected Degrees. [Citation Graph (0, 0)][DBLP ] Conf ] Douglas E. Carroll , Ashish Goel , Adam Meyerson Embedding Bounded Bandwidth Graphs into l1 . [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer , Leslie Ann Goldberg , Mike Paterson On Counting Homomorphisms to Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ben Reichardt Fault-Tolerance Threshold for a Distance-Three Quantum Code. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald de Wolf Lower Bounds on Matrix Rigidity Via a Quantum Argument. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Magniez , Dominic Mayers , Michele Mosca , Harold Ollivier Self-testing of Quantum Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Chia-Jung Lee , Chi-Jen Lu , Shi-Chun Tsai Deterministic Extractors for Independent-Symbol Sources. [Citation Graph (0, 0)][DBLP ] Conf ] Jaikumar Radhakrishnan Gap Amplification in PCPs Using Lazy Random Walks. [Citation Graph (0, 0)][DBLP ] Conf ] Magnus Bordewich , Martin E. Dyer , Marek Karpinski Stopping Times, Metrics and Approximate Counting. [Citation Graph (0, 0)][DBLP ] Conf ] Michal Kunc Algebraic Characterization of the Finite Power Property. [Citation Graph (0, 0)][DBLP ] Conf ] Turlough Neary , Damien Woods P-completeness of Cellular Automaton Rule 110. [Citation Graph (0, 0)][DBLP ] Conf ] Christos A. Kapoutsis Small Sweeping 2NFAs Are Not Closed Under Complement. [Citation Graph (0, 0)][DBLP ] Conf ] Mikolaj Bojanczyk , Mathias Samuelides , Thomas Schwentick , Luc Segoufin Expressive Power of Pebble Automata. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ravi , Mohit Singh Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs. [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg , Amit Kumar Better Algorithms for Minimizing Average Flow-Time on Related Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Kamalika Chaudhuri , Satish Rao , Samantha Riesenfeld , Kunal Talwar A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. [Citation Graph (0, 0)][DBLP ] Conf ] Satish Rao , Shuheng Zhou Edge Disjoint Paths in Moderately Connected Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Asaf Levin A Robust APTAS for the Classical Bin Packing Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Subhash Khot , Ashok Kumar Ponnuswami Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Harren Approximating the Orthogonal Knapsack Problem for Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Ramesh Hariharan , Telikepalli Kavitha , Kurt Mehlhorn A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Virginia Vassilevska , Ryan Williams , Raphael Yuster Finding the Smallest H -Subgraph in Real Weighted Graphs and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Sankowski Weighted Bipartite Matching in Matrix Multiplication Time. [Citation Graph (0, 0)][DBLP ] Conf ] Irene Finocchi , Fabrizio Grandoni , Giuseppe F. Italiano Optimal Resilient Sorting and Searching in the Presence of Memory Faults. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Ralf Osbild , Michael Sagraloff Reliable and Efficient Computational Geometry Via Controlled Perturbation. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Caragiannis , Michele Flammini , Christos Kaklamanis , Panagiotis Kanellopoulos , Luca Moscardelli Tight Bounds for Selfish and Greedy Load Balancing. [Citation Graph (0, 0)][DBLP ] Conf ] Arist Kojevnikov , Dmitry Itsykson Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow , John M. Hitchcock , Aduri Pavan , N. V. Vinodchandran , Fengming Wang Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. [Citation Graph (0, 0)][DBLP ] Conf ] Parikshit Gopalan , Phokion G. Kolaitis , Elitza N. Maneva , Christos H. Papadimitriou The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Tsvi Kopelowitz , Moshe Lewenstein Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Golynski Optimal Lower Bounds for Rank and Select Indexes. [Citation Graph (0, 0)][DBLP ] Conf ] Alexis C. Kaporis , Christos Makris , Spyros Sioutas , Athanasios K. Tsakalidis , Kostas Tsichlas , Christos D. Zaroliagis Dynamic Interpolation Search Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Gudmund Skovbjerg Frandsen , Peter Frands Frandsen Dynamic Matrix Rank. [Citation Graph (0, 0)][DBLP ] Conf ] Xin He , Huaming Zhang Nearly Optimal Visibility Representations of Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hristo Djidjev , Imrich Vrto Planar Crossing Numbers of Genus g Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Toshihiro Fujito How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Kortsarz , Zeev Nutov Tight Approximation Algorithm for Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Thanh Minh Hoang , Meena Mahajan , Thomas Thierauf On the Bipartite Unique Perfect Matching Problem. [Citation Graph (0, 0)][DBLP ] Conf ] John M. Hitchcock , Aduri Pavan Comparing Reductions to NP-Complete Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Deeparnab Chakrabarty , Aranyak Mehta , Vijay V. Vazirani Design Is as Easy as Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Xi Chen , Xiaotie Deng On the Complexity of 2D Discrete Fixed Point Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Gairing , Burkhard Monien , Karsten Tiemann Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Constantinos Daskalakis , Alex Fabrikant , Christos H. Papadimitriou The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Cominetti , José R. Correa , Nicolás E. Stier Moses Network Games with Atomic Players. [Citation Graph (0, 0)][DBLP ] Conf ] David Doty , Jack H. Lutz , Satyadev Nandakumar Finite-State Dimension and Real Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Björklund , Thore Husfeldt Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Ferragina , Raffaele Giancarlo , Giovanni Manzini The Myriad Virtues of Wavelet Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Fotakis , Spyros C. Kontogiannis , Paul G. Spirakis Atomic Congestion Games Among Coalitions. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Codenotti , Luis Rademacher , Kasturi R. Varadarajan Computing Equilibrium Prices in Exchange Economies with Tax Distortions. [Citation Graph (0, 0)][DBLP ] Conf ] Vincenzo Auletta , Roberto De Prisco , Paolo Penna , Giuseppe Persiano , Carmine Ventre New Constructions of Mechanisms with Verification. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Haim Kaplan , Meital Levy , Svetlana Olonetsky , Ronen Shabo On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Korman , David Peleg Dynamic Routing Schemes for General Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kei Uchizawa , Rodney J. Douglas , Wolfgang Maass Energy Complexity and Entropy of Threshold Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Philip Bille New Algorithms for Regular Expression Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Dániel Marx A Parameterized View on Matroid Optimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Guy E. Blelloch , Kedar Dhamdhere , Eran Halperin , R. Ravi , Russell Schwartz , Srinath Sridhar Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Baier , Thomas Erlebach , Alexander Hall , Ekkehard Köhler , Heiko Schilling , Martin Skutella Length-Bounded Cuts and Flows. [Citation Graph (0, 0)][DBLP ] Conf ] Amin Coja-Oghlan An Adaptive Spectral Heuristic for Partitioning Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Vinay Choudhary Some Results on Matchgates and Holographic Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Julián Mestre Weighted Popular Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] 