default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th SWAT 2014: Copenhagen, Denmark
- R. Ravi, Inge Li Gørtz
:
Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. Lecture Notes in Computer Science 8503, Springer 2014, ISBN 978-3-319-08403-9 - Peyman Afshani, Nodari Sitchinava:
I/O-Efficient Range Minima Queries. 1-12 - Susanne Albers, Matthias Hellwig:
Online Makespan Minimization with Parallel Schedules. 13-25 - Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen:
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn). 26-37 - Huck Bennett, Chee Yap:
Amortized Analysis of Smooth Quadtrees in All Dimensions. 38-49 - Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann:
New Approximability Results for the Robust k-Median Problem. 50-61 - Therese Biedl:
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs. 62-73 - Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the Revenue Maximization Problem with Sharp Demands. 74-85 - Paul S. Bonsma, Marcin Kaminski, Marcin Wrochna:
Reconfiguring Independent Sets in Claw-Free Graphs. 86-97 - Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian:
Competitive Online Routing on Delaunay Triangulations. 98-109 - Gerth Stølting Brodal, Kasper Green Larsen:
Optimal Planar Orthogonal Skyline Counting Queries. 110-121 - Trevor Brown:
B-slack Trees: Space Efficient B-Trees. 122-133 - Søren Dahlgaard, Mikkel Thorup:
Approximately Minwise Independence with Twisted Tabulation. 134-145 - Mark de Berg, Ali D. Mehrabi, Farnaz Sheikhi:
Separability of Imprecise Points. 146-157 - Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-Distortion, Bandwidth and Path-Length of a Graph. 158-169 - György Dósa, Leah Epstein:
Colorful Bin Packing. 170-181 - Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca:
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques. 182-193 - Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-Win Kernelization for Degree Sequence Completion Problems. 194-205 - Toshihiro Fujito:
On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem. 206-216 - Takuro Fukunaga:
Covering Problems in Edge- and Node-Weighted Graphs. 217-228 - Roberto Grossi, Søren Vind:
Colored Range Searching in Linear Space. 229-240 - Yoichi Iwata, Keigo Oka:
Fast Dynamic Graph Algorithms for Parameterized Problems. 241-252 - Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. 253-264 - Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg:
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. 265-276 - Mathias Bæk Tejs Knudsen:
Additive Spanners: A Simple Construction. 277-281 - Lukasz Kowalik, Arkadiusz Socala:
Assigning Channels via the Meet-in-the-Middle Approach. 282-293 - Konstantin Kutzkov, Rasmus Pagh:
Consistent Subset Sampling. 294-305 - Konstantin Kutzkov, Rasmus Pagh:
Triangle Counting in Dynamic Graph Streams. 306-318 - Ekkehard Köhler, Lalla Mouatadid:
Linear Time LexDFS on Cocomparability Graphs. 319-330 - François Le Gall, Harumichi Nishimura:
Quantum Algorithms for Matrix Products over Semirings. 331-343 - J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan:
Ranked Document Selection. 344-356 - Anup Joshi, N. S. Narayanaswamy:
Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments. 357-367 - Yota Otachi, Pascal Schweitzer:
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. 368-379 - Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in (3, 3)-Hypergraphs. 380-391
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 2025-01-03 23:17 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:
