- Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings with Two-Sided Preferences and One-Sided Ties. ICALP (1) 2015: 367-379 - Radu Curticapean:
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity. ICALP (1) 2015: 380-392 - Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski:
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. ICALP (1) 2015: 393-405 - Yann Disser, Max Klimm, Elisabeth Lübbecke:
Scheduling Bidirectional Traffic on a Path. ICALP (1) 2015: 406-418 - Dean Doron, Amnon Ta-Shma:
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace. ICALP (1) 2015: 419-431 - Zdenek Dvorák, Martin Kupec:
On Planar Boolean CSP. ICALP (1) 2015: 432-443 - Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On Temporal Graph Exploration. ICALP (1) 2015: 444-455 - Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi:
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation. ICALP (1) 2015: 456-468 - Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post:
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. ICALP (1) 2015: 469-480 - Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Lower Bounds for the Graph Homomorphism Problem. ICALP (1) 2015: 481-493 - Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) 2015: 494-505 - Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy Does not Separate Information and Communication Complexity. ICALP (1) 2015: 506-516 - Peter Fulla, Stanislav Zivný:
A Galois Connection for Valued Constraint Languages of Infinite Size. ICALP (1) 2015: 517-528 - Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. ICALP (1) 2015: 529-541 - Sumit Ganguly:
Taylor Polynomial Estimator for Estimating Frequency Moments. ICALP (1) 2015: 542-553 - Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria. ICALP (1) 2015: 554-566 - Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. ICALP (1) 2015: 580-592 - Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Encodings for Range Top- k k , Selection, and Min-Max. ICALP (1) 2015: 593-604 - Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Vertex Connectivity in Directed Graphs. ICALP (1) 2015: 605-616 - Sevag Gharibian, Jamie Sikora:
Ground State Connectivity of Local Hamiltonians. ICALP (1) 2015: 617-628 - Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) 2015: 629-641 - Leslie Ann Goldberg, Rob Gysel, John Lapinskas:
Approximately Counting Locally-Optimal Structures. ICALP (1) 2015: 654-665 - Oded Goldreich, Tom Gur, Ron D. Rothblum:
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract). ICALP (1) 2015: 666-677 - Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths. ICALP (1) 2015: 678-688 - Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick:
Hollow Heaps. ICALP (1) 2015: 689-700 - Brett Hemenway, Mary Wootters:
Linear-Time List Recovery of High-Rate Expander Codes. ICALP (1) 2015: 701-712 - Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer:
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time. ICALP (1) 2015: 713-724 - Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. ICALP (1) 2015: 725-736 - Lingxiao Huang, Jian Li:
Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points. ICALP (1) 2015: 910-921