Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I > 2-Vertex Connectivity in Directed Graphs
Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I |
Magnús M. Halldórsson; Kazuo Iwama; Naoki Kobayashi; Bettina Speckmann
Springer Berlin Heidelberg
Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
2-Vertex Connectivity in Directed Graphs
Authors

Loukas Georgiadis; Giuseppe F. Italiano; Luigi Laura; Nikos Parotsidis

ARI Id

1674219779172_3369303

Access

Not Available Free

Pages

605-616

DOI

10.1007/978-3-662-47672-7_49

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-662-47672-7_49

Table of Contents of Book
Showing 1 to 20 of 91 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XXXI
Statistical Randomized Encodings: A Complexity Theoretic View
Shweta Agrawal; Yuval Ishai; Dakshita Khurana; Anat Paskin-Cherniavsky
1-13
Tighter Fourier Transform Lower Bounds
Nir Ailon
14-25
Quantifying Competitiveness in Paging with Locality of Reference
Susanne Albers; Dario Frascaria
26-38
Approximation Algorithms for Computing Maximin Share Allocations
Georgios Amanatidis; Evangelos Markakis; Afshin Nikzad; Amin Saberi
39-51
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare
Elliot Anshelevich; Koushik Kar; Shreyas Sekar
52-64
Batched Point Location in SINR Diagrams via Algebraic Tools
Boris Aronov; Matthew J. Katz
65-77
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs
Noa Avigdor-Elgrabli; Sungjin Im; Benjamin Moseley; Yuval Rabani
78-90
Serving in the Dark should be done Non-Uniformly
Yossi Azar; Ilan Reuven Cohen
91-102
Finding the Median (Obliviously) with Bounded Space
Paul Beame; Vincent Liew; Mihai Pǎtraşcu
103-115
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median
Babak Behsaz; Zachary Friggstad; Mohammad R. Salavatipour; Rohit Sivakumar
116-128
Solving Linear Programming with Constraints Unknown
Xiaohui Bei; Ning Chen; Shengyu Zhang
129-142
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
Salman Beigi; Omid Etesami; Amin Gohari
143-154
Limitations of Algebraic Approaches to Graph Isomorphism Testing
Christoph Berkholz; Martin Grohe
155-166
Fully Dynamic Matching in Bipartite Graphs
Aaron Bernstein; Cliff Stein
167-179
Feasible Interpolation for QBF Resolution Calculi
Olaf Beyersdorff; Leroy Chew; Meena Mahajan; Anil Shukla
180-192
Simultaneous Approximation of Constraint Satisfaction Problems
Amey Bhangale; Swastik Kopparty; Sushant Sachdeva
193-205
Design of Dynamic Algorithms via Primal-Dual Method
Sayan Bhattacharya; Monika Henzinger; Giuseppe F. Italiano
206-218
What Percentage of Programs Halt?
Laurent Bienvenu; Damien Desfontaines; Alexander Shen
219-230
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems
Andreas Björklund; Holger Dell; Thore Husfeldt
231-242
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 91 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings