default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th SWAT 2012: Helsinki, Finland
- Fedor V. Fomin, Petteri Kaski:
Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Lecture Notes in Computer Science 7357, Springer 2012, ISBN 978-3-642-31154-3 - Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri
, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. 1-12 - Jessica Sherette, Carola Wenk:
Partial Matching between Surfaces Using Fréchet Distance. 13-23 - Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. 24-35 - Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
Watchman Routes for Lines and Segments. 36-47 - Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei:
Kinetic Pie Delaunay Graph and Its Applications. 48-58 - Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner:
Higher Order City Voronoi Diagrams. 59-70 - Babak Behsaz, Mohammad R. Salavatipour:
On Minimum Sum of Radii and Diameters Clustering. 71-82 - Tomas Hruz, Marcel Schöngens:
A Simple Framework for the Generalized Nearest Neighbor Problem. 83-94 - Marek Cygan:
Deterministic Parameterized Connected Vertex Cover. 95-106 - Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. 107-118 - Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. 119-130 - Yijie Han, Tadao Takaoka:
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths. 131-141 - Aistis Atminas, Vadim V. Lozin, Igor Razgon:
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. 142-152 - Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-Free Graphs. 153-164 - Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros:
Effective Computation of Immersion Obstructions for Unions of Graph Classes. 165-176 - Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang:
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. 177-188 - Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang:
Annotating Simplices with a Homology Basis and Its Applications. 189-200 - Rom Aschner, Matthew J. Katz, Gila Morgenstern:
Do Directional Antennas Facilitate in Reducing Interferences? 201-212 - Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth:
Minimum Convex Partitions and Maximum Empty Polytopes. 213-224 - Markus Bläser, Konstantinos Panagiotou, B. V. Raghavendra Rao:
A Probabilistic Analysis of Christofides' Algorithm. 225-236 - Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina:
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. 237-248 - Antonios Antoniadis, Chien-Chung Huang:
Non-preemptive Speed Scaling. 249-260 - Marie-Louise Bruner, Martin Lackner:
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. 261-270 - Yakov Nekrich, Gonzalo Navarro:
Sorted Range Reporting. 271-282 - Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind:
String Indexing for Patterns with Wildcards. 283-294 - Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. 295-306 - Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Asynchronous Rumor Spreading in Preferential Attachment Graphs. 307-315 - Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen:
Connectivity Oracles for Planar Graphs. 316-327 - Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. 328-339 - Yiannis Giannakopoulos, Elias Koutsoupias:
Competitive Analysis of Maintaining Frequent Items of a Stream. 340-351 - Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Structural Parameterizations of Pathwidth. 352-363 - Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman:
Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. 364-375 - Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Testing Formula Satisfaction. 376-387 - Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. 388-397
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-10-25 20:02 CEST 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:
