default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 77
Volume 77, Number 1, January 2017
- Noga Alon, Moran Feldman
, Moshe Tennenholtz:
Revenue and Reserve Prices in a Probabilistic Single Item Auction. 1-15 - Ashley Montanaro:
Quantum Pattern Matching Fast on Average. 16-39 - Danny Z. Chen, Haitao Wang:
Computing the Visibility Polygon of an Island in a Polygonal Domain. 40-64 - Weidong Li, Lusheng Wang, Wenjuan Cui:
A Polynomial Time Approximation Scheme for the Closest Shared Center Problem. 65-83 - Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management Under Approval-Driven Voting Rules. 84-115 - Shoshana Marcus, Dina Sokol:
2D Lyndon Words and Applications. 116-133 - Guy Feigenblat, Ely Porat, Ariel Shiftan:
A Grouping Approach for Succinct Dynamic Dictionary Matching. 134-150 - Guy Feigenblat, Ely Porat, Ariel Shiftan:
Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching. 151 - Wolfgang Dvorák, Monika Henzinger, David P. Williamson:
Maximizing a Submodular Function with Viability Constraints. 152-172 - Katharina T. Huber, Leo van Iersel, Vincent Moulton, Céline Scornavacca, Taoyang Wu:
Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. 173-200 - Bert Besser, Matthias Poloczek:
Greedy Matching: Guarantees and Limitations. 201-234 - Timo Bingmann, Andreas Eberle, Peter Sanders:
Engineering Parallel String Sorting. 235-286 - Stephan Held, Sophie Spirkl:
Fast Prefix Adders for Non-uniform Input Arrival Times. 287-308
Volume 77, Number 2, February 2017
- Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt:
Certifying 3-Edge-Connectivity. 309-335 - Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compressed Subsequence Matching and Packed Tree Coloring. 336-348 - Rom Aschner, Matthew J. Katz:
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints. 349-373 - Roberto Solis-Oba, Paul S. Bonsma, Stefanie Lowski:
A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. 374-388 - Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri:
Resilient Dynamic Programming. 389-425 - Hung-Lung Wang:
An Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree. 426-439 - Ari Freund:
Improved Subquadratic 3SUM. 440-458 - Troy Lee, Frédéric Magniez, Miklos Santha:
Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing. 459-486 - Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. 487-514 - S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. 515-536 - Benjamin Hescott, Caleb Malchik, Andrew Winslow:
Tight Bounds for Active Self-Assembly Using an Insertion Primitive. 537-554 - Pasin Manurangsi, Dana Moshkovitz:
Improved Approximation Algorithms for Projection Games. 555-594 - Lisa Hellerstein, Özgür Özkan, Linda Sellie:
Max-Throughput for (Conservative) k-of-n Testing. 595-618
Volume 77, Number 3, March 2017
- Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. 619-641 - Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Exact Algorithms for Minimum Weighted Dominating Induced Matching. 642-660 - Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, Tonguç Ünlüyurt:
Evaluation of Monotone DNF Formulas. 661-685 - Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-Distortion, Bandwidth and Path-Length of a Graph. 686-713 - Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Path Traversal in Succinct Planar Graphs. 714-755 - Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
Combinatorial Auctions Without Money. 756-785 - Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo:
Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs. 786-814 - Shun Sato:
Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors. 815-835 - Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum: Complexity and Approximation for a Matching Game. 836-866 - Sándor P. Fekete, Hella-Franziska Hoffmann:
Online Square-into-Square Packing. 867-901 - Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. 902-920 - Lasse Kliemann:
The Price of Anarchy in Bilateral Network Formation in an Adversary Model. 921-941 - Lélia Blin, Janna Burman, Nicolas Nisse:
Exclusive Graph Searching. 942-969
Volume 77, Number 4, April 2017
- Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee:
Local Computation Algorithms for Graphs of Non-constant Degrees. 971-994 - Carlo Comin, Romeo Rizzi:
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. 995-1021 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing for Embedded Planar Graphs. 1022-1059 - Piotr Micek, Veit Wiechert:
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths. 1060-1070 - 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. 1071-1104 - Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A Constant Factor Approximation Algorithm for the Storage Allocation Problem. 1105-1127 - Yusuke Kobayashi, Sho Toyooka:
Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation. 1128-1142 - Ioannis Caragiannis, Angelo Fanelli, Nick Gravin:
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. 1143-1158 - Gahyun Park:
A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds. 1159-1193 - Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. 1194-1215 - Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. 1216-1239 - David Furcy, Samuel Micka, Scott M. Summers:
Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D. 1240-1282 - Andreas Brandstädt, Raffaele Mosca:
Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time. 1283-1302
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-06-29 20:49 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:
