Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 67
Volume 67, Number 1, September 2013
- Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto
:
Guest Editorial: Selected Papers from ISAAC 2011. 1-2 - Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov:
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. 3-22 - Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler:
External-Memory Multimaps. 23-48 - Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità:
The School Bus Problem on Trees. 49-64 - Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. 65-88 - Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined. 89-110
Volume 67, Number 2, October 2013
- Editorial Note. 111
- Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing the HSSW Algorithm for 3-SAT. 112-124 - Huy Hoang Do, Wing-Kin Sung:
Compressed Directed Acyclic Word Graph with Application in Local Alignment. 125-141 - Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker:
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time. 142-160 - Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. 161-179 - Narayan Vikas:
Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction. 180-206 - Steven M. Kautz, Brad Shutters:
Self-Assembling Rulers for Approximating Generalized Sierpinski Carpets. 207-233 - Lauri Ahlroth, Olli Pottonen, André Schumacher:
Approximately Uniform Online Checkpointing with Bounded Memory. 234-246 - Vikraman Arvind, Johannes Köbler:
The Parallel Complexity of Graph Canonization Under Abelian Group Action. 247-276 - Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai:
On Total Unimodularity of Edge-Edge Adjacency Matrices. 277-292
Volume 67, Number 3, November 2013
- Ferdinando Cicalese, Ely Porat:
Guest Editorial for "Group Testing: models and applications". 293-294 - Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz:
Unbounded Contention Resolution in Multiple-Access Channels. 295-314 - Gábor Wiener:
Rounds in Combinatorial Search. 315-323 - Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch:
Two New Perspectives on Multi-Stage Group Testing. 324-354 - Michael Huber:
Efficient Two-Stage Group Testing Algorithms for Genetic Screening. 355-367 - Yaw-Ling Lin, Charles B. Ward, Steven Skiena:
Synthetic Sequence Design for Signal Location Search. 368-383 - Mahdi Cheraghchi:
Improved Constructions for Non-adaptive Threshold Group Testing. 384-417 - Hung Q. Ngo, Duong Hieu Phan, David Pointcheval:
Black-Box Trace&Revoke Codes. 418-448
Volume 67, Number 4, December 2013
- Camil Demetrescu, Magnús M. Halldórsson:
Editorial. 449-450 - Nikhil Bansal, Joel Spencer:
Deterministic Discrepancy Minimization. 451-471 - Shayan Oveis Gharan, Jan Vondrák:
On Variants of the Matroid Secretary Problem. 472-497 - Lukasz Jez:
A Universal Randomized Packet Scheduling Algorithm. 498-515 - Ely Porat, Liam Roditty:
Preprocess, Set, Query! 516-528 - Paolo Ferragina, Jouni Sirén, Rossano Venturini:
Distribution-Aware Compressed Full-Text Indexes. 529-546 - Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. 547-565
a service of 
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-09-07 01:07 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:
