Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 74
Volume 74, Number 1, January 2016
- Artur Jez
:
One-Variable Word Equations in Linear Time. 1-48 - Iftah Gamzu, Moti Medina:
Improved Approximation for Orienting Mixed Graphs. 49-64 - Alessio Orlandi, Rossano Venturini:
Space-Efficient Substring Occurrence Estimation. 65-90 - Nan Liu, Daming Zhu, Haitao Jiang, Binhai Zhu:
A 1.5-Approximation Algorithm for Two-Sided Scaffold Filling. 91-116 - Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Convergecast and Broadcast by Power-Aware Mobile Agents. 117-155 - Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee:
Online Scheduling of Jobs with Fixed Start Times on Related Machines. 156-176 - Leah Epstein, Elena Kleiman, Julián Mestre:
Parametric Packing of Selfish Items and the Subset Sum Algorithm. 177-207 - Klaus Jansen, Lars Prädel:
New Approximability Results for Two-Dimensional Bin Packing. 208-269 - Matthew D. Williamson, Pavlos Eirinakis, K. Subramani:
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem. 270-325 - Zahra Jafargholi, Emanuele Viola:
3SUM, 3XOR, Triangles. 326-343 - Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan:
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees. 344-366 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo:
Parameterizations of Test Cover with Bounded Test Sizes. 367-384 - George B. Mertzios, Paul G. Spirakis:
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. 385-414 - Evanthia Papadopoulou, Maksym Zavershynskyi:
The Higher-Order Voronoi Diagram of Line Segments. 415-439 - Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
The Hospitals/Residents Problem with Lower Quotas. 440-465 - Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
Randomized Fixed-Parameter Algorithms for the Closest String Problem. 466-484 - Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud:
Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. 485-506 - Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. 507-527 - Tim Nonner:
PTAS for Densest k-Subgraph in Interval Graphs. 528-539 - Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. 540-557
Volume 74, Number 2, February 2016
- Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
The Focus of Attention Problem. 559-573 - Mourad El Ouali, Peter Munstermann, Anand Srivastav:
Randomized Approximation for the Set Multicover Problem in Hypergraphs. 574-588 - Yossi Azar, Niv Buchbinder, Kamal Jain:
How to Allocate Goods in an Online Market? 589-601 - Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Parameterized Algorithms for Finding Square Roots. 602-629 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk:
On Group Feedback Vertex Set Parameterized by the Size of the Cutset. 630-642 - Sergio Cabello, Panos Giannopoulos:
The Complexity of Separating Points in the Plane. 643-663 - Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos:
Authenticated Hash Tables Based on Cryptographic Accumulators. 664-712 - Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure. 713-741 - Diego Arroyuelo, Pooya Davoodi, Srinivasa Rao Satti:
Succinct Dynamic Cardinal Trees. 742-777 - Tomoya Hibi, Toshihiro Fujito:
Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications. 778-786 - Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff:
Space-Efficient Estimation of Statistics Over Sub-Sampled Streams. 787-811 - Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods:
The Two-Handed Tile Assembly Model is not Intrinsically Universal. 812-850 - Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland:
Quantum Walks Can Find a Marked Element on Any Graph. 851-907 - Yoann Dieudonné, Andrzej Pelc:
Anonymous Meeting in Networks. 908-946 - Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Constrained Multilinear Detection and Generalized Graph Motifs. 947-967
Volume 74, Number 3, March 2016
- Samir Khuller, Barna Saha, Kanthi K. Sarpatwar:
New Approximation Results for Resource Replication Problems. 969-991 - Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. 992-1018 - Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Testing Lipschitz Functions on Hypergrid Domains. 1055-1081 - Gonzalo Navarro, Sharma V. Thankachan:
Optimal Encodings for Range Majority Queries. 1082-1098 - Djamal Belazzougui, Rossano Venturini:
Compressed String Dictionary Search with Edit Distance One. 1099-1122 - Donatella Firmani, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Strong Articulation Points and Strong Bridges in Large Scale Graphs. 1123-1147 - Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
Vertex Cover Meets Scheduling. 1148-1173 - Mourad Baïou, Francisco Barahona:
Stackelberg Bipartite Vertex Cover and the Preflow Algorithm. 1174-1183 - Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
Fair Matchings and Related Problems. 1184-1203
Volume 74, Number 4, April 2016
- Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén:
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. 1205-1223 - Ulrich Laube, Markus E. Nebel:
Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. 1224-1266 - Amihood Amir, Haim Paryenty, Liam Roditty:
Configurations and Minority in the String Consensus Problem. 1267-1292 - Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Outer 1-Planar Graphs. 1293-1320 - Sanjit Chatterjee, Chethan Kamath:
A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound. 1321-1362 - Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
On Resilient Graph Spanners. 1363-1385 - Olivier Gascuel, Mike A. Steel:
A 'Stochastic Safety Radius' for Distance-Based Tree Reconstruction. 1386-1403 - Spyros C. Kontogiannis, Christos D. Zaroliagis:
Distance Oracles for Time-Dependent Networks. 1404-1434 - Lukasz Kowalik, Arkadiusz Socala:
Assigning Channels Via the Meet-in-the-Middle Approach. 1435-1452 - Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt:
Structural Parameterizations for Boxicity. 1453-1472 - Jin-Yi Cai, Pinyan Lu:
Erratum to: Signature Theory in Holographic Algorithms. 1473-1476
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-04-18 21:14 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:
