default search action
23. ESA 2015: Patras, Greece
- Nikhil Bansal, Irene Finocchi
:
Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Lecture Notes in Computer Science 9294, Springer 2015, ISBN 978-3-662-48349-7 - Marek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee:
Improved Approximation Algorithms for Stochastic Matching. 1-12 - Peyman Afshani, Nodari Sitchinava:
Sorting and Permuting without Bank Conflicts on GPUs. 13-24 - Helmut Alt, Mark de Berg, Christian Knauer:
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. 25-34 - Spyros Angelopoulos, Giorgio Lucarelli
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems. 35-46 - Yossi Azar, Oren Gilon:
Buffer Management for Packets with Processing Times. 47-58 - Davaatseren Baatar
A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem. 59-70 - Alon Baram, Efi Fogel
Exact Minkowski Sums of Polygons With Holes. 71-82 - Gill Barequet, Günter Rote, Mira Shalah:
λ > 4. 83-94 - MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Revenue Maximization for Selling Multiple Correlated Items. 95-105 - Niklas Baumstark, Guy E. Blelloch, Julian Shun:
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm. 106-117 - Abbas Bazzi, Ashkan Norouzi-Fard:
Towards Tight Lower Bounds for Scheduling Problems. 118-129 - Michael A. Bekos
1-Planar Graphs have Constant Book Thickness. 130-141 - Djamal Belazzougui, Patrick Hagge Cording, Simon J. Puglisi
Access, Rank, and Select in Grammar-compressed Strings. 142-154 - Elisabetta Bergamini, Henning Meyerhenke
Fully-Dynamic Approximation of Betweenness Centrality. 155-166 - Davide Bilò
Improved Purely Additive Fault-Tolerant Spanners. 167-178 - Hans L. Bodlaender
Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. 179-190 - Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos
Enumeration of 2-Level Polytopes. 191-202 - Nicolas Bonichon, Prosenjit Bose
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. 203-214 - Michele Borassi, David Coudert, Pierluigi Crescenzi
On Computing the Hyperbolicity of Real-World Graphs. 215-226 - Glencora Borradaile, Amir Nayyeri, Farzad Zafarani:
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs. 227-238 - Christina Boucher, Christine Lo, Daniel Lokshtanov:
Consensus Patterns (Probably) Has no EPTAS. 239-250 - Ulrik Brandes, Michael Hamann
Fast Quasi-Threshold Editing. 251-262 - Marc Bury, Chris Schwiegelshohn:
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams. 263-274 - Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. 275-287 - Fritz Bökler
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems. 288-299 - Parinya Chalermsook, Mayank Goswami, László Kozma
Self-Adjusting Binary Search Trees: What Makes Them Tick? 300-312 - Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu
On Element-Connectivity Preserving Graph Simplification. 313-324 - Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan:
On Randomized Algorithms for Matching in the Online Preemptive Model. 325-336 - Iffat Chowdhury, Matt Gibson:
A Characterization of Consistent Digital Line Segments in ℤ2. 337-348 - George Christodoulou
On the Efficiency of All-Pay Mechanisms. 349-360 - Raphaël Clifford, Allyx Fontaine
Dictionary Matching in a Stream. 361-372 - Éric Colin de Verdière:
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. 373-385 - Vincent Cohen-Addad, Arnaud de Mesmay:
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. 386-398 - Michael Dinitz, Michael Schapira, Asaf Valadarsky:
Explicit Expanding Expanders. 399-410 - Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
On the Threshold of Intractability. 411-423 - Pål Grønås Drange, Michal Pilipczuk
A Polynomial Kernel for Trivially Perfect Editing. 424-436 - Paul Dütting, Robert Kleinberg:
Polymatroid Prophet Inequalities. 437-449 - Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella:
Node-Balancing by Edge-Increments. 450-458 - Yuval Emek, Tobias Langner, Roger Wattenhofer:
The Price of Matching with Metric Preferences. 459-470 - Leah Epstein, Elena Kleiman:
Selfish Vector Packing. 471-482 - Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità:
Approximate Deadline-Scheduling with Precedence Constraints. 483-495 - Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. 496-508 - Michael Etscheid, Heiko Röglin
Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem. 509-520 - Moran Feldman
Maximizing Symmetric Submodular Functions. 521-532 - Johannes Fischer, Travis Gagie
Approximating LZ77 via Small-Space Multiple-Pattern Matching. 533-544 - Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. 545-556 - Jie Gao, Mayank Goswami:
Medial Axis Based Routing Has Constant Load Balancing Factor. 557-569 - Kyle Genova, David P. Williamson:
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem. 570-581 - Loukas Georgiadis
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. 582-594 - Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh:
A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations. 595-606 - Matt Gibson, Erik Krohn, Qing Wang:
A Characterization of Visibility Graphs for Pseudo-polygons. 607-618 - Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck:
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. 619-630 - Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov:
The Temp Secretary Problem. 631-642 - Daniel Graf:
How to Sort by Walking on a Tree. 643-655 - Anna Großwendt, Heiko Röglin
Improved Analysis of Complete-Linkage Clustering. 656-667 - Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
Structural Parameterizations of the Mixed Chinese Postman Problem. 668-679 - Oliver Göbel, Thomas Kesselheim, Andreas Tönnis
Online Appointment Scheduling in the Random Order Model. 680-692 - Mohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation Algorithms for Connected Maximum Cut and Related Problems. 693-704 - Dan Halperin, Michael Kerber, Doron Shaharabani:
The Offset Filtration of Convex Objects. 705-716 - Sariel Har-Peled
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. 717-728 - Xin He, Dayu He:
Monotone Drawings of 3-Connected Plane Graphs. 729-741 - Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Faster Fully-Dynamic Minimum Spanning Forest. 742-753 - Yoichi Iwata, Yuichi Yoshida:
On the Equivalence among Problems of Bounded Width. 754-765 - Riko Jacob, Morten Stöckel:
Fast Output-Sensitive Matrix Multiplication. 766-778 - Bart M. P. Jansen, Stefan Kratsch:
A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity. 779-791 - Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket:
On the Approximability of Digraph Ordering. 792-803 - Anthony Kim
Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems. 804-815 - Kenta Kitsunai, Yasuaki Kobayashi
On the Pathwidth of Almost Semicomplete Digraphs. 816-827 - Mathias Bæk Tejs Knudsen, Morten Stöckel:
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. 828-839 - Christian Konrad:
Maximum Matching in Turnstile Streams. 840-852 - Adam Kurpisz
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. 853-864 - Dániel Marx, Michal Pilipczuk
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. 865-877 - Nicole Megow
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. 878-890 - J. Ian Munro, Yakov Nekrich
Compressed Data Structures for Dynamic Sequences. 891-902 - Norbert Bus, Nabil H. Mustafa
Geometric Hitting Sets for Disks: Theory and Practice. 903-914 - Torsten Mütze, Jerri Nummenpalo:
Efficient Computation of Middle Levels Gray Codes. 915-927 - Kevin Buchin
Computing the Similarity Between Moving Curves. 928-940 - Rasmus Pagh, Ninh Pham
I/O-Efficient Similarity Join. 941-952 - Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan:
Improved Approximation Algorithms for Weighted 2-Path Partitions. 953-964 - Hadas Shachnai, Meirav Zehavi
A Multivariate Approach for Weighted FPT Algorithms. 965-976 - Micha Sharir, Adam Sheffer, Noam Solomon:
Incidences with Curves in ℝ d. 977-988 - Spyros Sioutas, Efrosini Sourla, Kostas Tsichlas, Christos D. Zaroliagis
D3-Tree: A Dynamic Deterministic Decentralized Structure. 989-1000 - Jara Uitto, Roger Wattenhofer:
Ignorant vs. Anonymous Recommendations. 1001-1012 - Colin White:
Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms. 1013-1024 - Sascha Witt:
Trip-Based Public Transit Routing. 1025-1036 - Meirav Zehavi
Mixing Color Coding-Related Techniques. 1037-1049
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: