The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Algorithmica"( http://dblp.L3S.de/Venues/Algorithmica )

URL (DBLP): http://dblp.uni-trier.de/db/journals/algorithmica

Publication years (Num. hits)
1986 (29) 1987 (27) 1988 (26) 1989 (36) 1990 (33) 1991 (47) 1992 (57) 1993 (58) 1994 (60) 1995 (54) 1996 (68) 1997 (79) 1998 (73) 1999 (68) 2000 (73) 2001 (89) 2002 (95) 2003 (53) 2004 (74) 2005 (54) 2006 (77) 2007 (77) 2008 (79) 2009 (96) 2010 (125) 2011 (133) 2012 (136) 2013 (108) 2014 (119) 2015 (130) 2016 (146) 2017 (158) 2018 (164) 2019 (161) 2020 (140) 2021 (129) 2022 (140) 2023 (137) 2024 (58)
Publication types (Num. hits)
article(3466)
Venues (Conferences, Journals, ...)
Algorithmica(3466)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1597 occurrences of 761 keywords

Results
Found 3466 publication records. Showing 3466 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Jessica Chang, Harold N. Gabow, Samir Khuller A Model for Minimizing Active Processor Time. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 On Cutwidth Parameterized by Vertex Cover. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Francis Y. L. Chin, Marek Chrobak, Li Yan Algorithms for Placing Monitors in a Flow Network. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal 0001, Niv Buchbinder, Anupam Gupta 0001, Joseph Naor A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jinhui Xu 0001, Lei Xu 0006, Evanthia Papadopoulou Computing the Map of Geometric Minimal Cuts. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk Scheduling Partially Ordered Jobs Faster than 2 n. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Joachim Gehweiler, Christiane Lammersen, Christian Sohler A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Zeev Nutov Degree Constrained Node-Connectivity Problems. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jérémy Barbay, Francisco Claude, Travis Gagie, Gonzalo Navarro 0001, Yakov Nekrich Efficient Fully-Compressed Sequence Representations. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Gad M. Landau, Oren Weimann On Cartesian Trees and Range Minimum Queries. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Mashhood Ishaque, Csaba D. Tóth Relative Convex Hulls in Semi-Dynamic Arrangements. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ahmed Helmi 0001, Conrado Martínez, Alois Panholzer Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski 0001, Daniël Paulusma Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ruiwen Chen, Valentine Kabanets, Jeff Kinne Lower Bounds Against Weakly-Uniform Threshold Circuits. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1M. Reza Khani, Mohammad R. Salavatipour Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Andrew R. A. McGrae, Michele Zito 0001 The Complexity of the Empire Colouring Problem. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong Routing Regardless of Network Stability. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Keren Cohen, Raphael Yuster On Minimum Witnesses for Boolean Matrix Multiplication. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson 0001, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian Necklaces, Convolutions, and X+Y. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil Practical and Efficient Split Decomposition via Graph-Labelled Trees. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski On the Computational Complexity of Measuring Global Stability of Banking Networks. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler Analysis of Agglomerative Clustering. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Stasys Jukna Limitations of Incremental Dynamic Programming. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Philip Bille, Inge Li Gørtz Substring Range Reporting. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Johannes Uhlmann A Cubic-Vertex Kernel for Flip Consensus Tree. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh Better Size Estimation for Sparse Matrix Products. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Tomás Ebenlendr, Marek Krcál, Jirí Sgall Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Danny Z. Chen, Haitao Wang 0001 Outlier Respecting Points Approximation. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul Contracting Graphs to Paths and Trees. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta 2-Layer Right Angle Crossing Drawings. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Davide Bilò, Luciano Gualà, Guido Proietti Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Giorgos Christodoulou 0001, Kurt Mehlhorn, Evangelia Pyrga Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Ekkehard Köhler An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Anne Benoit, Matthieu Gallet, Bruno Gaujal, Yves Robert Computing the Throughput of Probabilistic and Replicated Streaming Applications. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh Improved Algorithms for Partial Curve Matching. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger Enumerating Minimal Subset Feedback Vertex Sets. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Daniel Johannsen, Piyush P. Kurur, Johannes Lengler Evolutionary Algorithms for Quantum Computers. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Toshimasa Ishii, Kazuhisa Makino Augmenting Edge-Connectivity between Vertex Subsets. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Zhi-Zhong Chen, Wenji Ma, Lusheng Wang 0001 The Parameterized Complexity of the Shared Center Problem. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Leah Epstein, Asaf Levin Robust Algorithms for Preemptive Scheduling. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Po-Shen Loh, Rasmus Pagh Thresholds for Extreme Orientability. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1 Editor's Note. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michael T. Goodrich Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Leonor Frias, Salvador Roura Multikey Quickselect. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca Dominating Induced Matchings for P 7-Free Graphs in Linear Time. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Hiroshi Fujiwara, Tobias Jacobs On the Huffman and Alphabetic Tree Problem with General Cost Functions. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Erik D. Demaine, Siamak Tazari Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Martin Fürer Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis Approximating Fixation Probabilities in the Generalized Moran Process. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Atlas F. Cook IV, Carola Wenk Shortest Path Problems on a Polyhedral Surface. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller Online Coloring of Bipartite Graphs with and without Advice. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Oswin Aichholzer, Matias Korman, Alexander Pilz, Birgit Vogtenhuber Geodesic Order Types. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Steven Kelk, Céline Scornavacca Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Fabian Müller, Swen Schmelzer Speed Scaling on Parallel Processors. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron A Generalization of the Convex Kakeya Problem. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1David Fernández-Baca Editorial. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Meng He 0001, J. Ian Munro, Gelin Zhou A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Eric McDermid, Robert W. Irving Sex-Equal Stable Matchings: Complexity and Exact Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Frank Kammer, Torsten Tholey Approximation Algorithms for Intersection Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Robert Crowston, Gregory Z. Gutin, Mark Jones 0001, Venkatesh Raman 0001, Saket Saurabh 0001, Anders Yeo Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Danny Z. Chen, Haitao Wang 0001 New Algorithms for Facility Location Problems on the Real Line. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao 0001 Optimal Indexes for Sparse Bit Vectors. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Daniel Dadush A Randomized Sieving Algorithm for Approximate Integer Programming. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky Strong Conflict-Free Coloring for Intervals. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marcel Wild Counting or Producing All Fixed Cardinality Transversals. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Matthias Englert, Heiko Röglin, Berthold Vöcking Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marcin Bienkowski An Optimal Lower Bound for Buffer Management in Multi-Queue Switches. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil Practical and Efficient Circle Graph Recognition. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro 0001 Improved Approximation Algorithms for the Average-Case Tree Searching Problem. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rasmus Pagh, Zhewei Wei, Ke Yi 0001, Qin Zhang 0001 Cache-Oblivious Hashing. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song 0002 A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ragesh Jaiswal, Amit Kumar 0001, Sandeep Sen A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Costas Busch, Ryan LaFortune, Srikanta Tirthapura Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Tom Kamphans, Nils Schweer Online Square Packing with Gravity. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Adrian Dumitrescu, Minghui Jiang 0001, János Pach Opaque Sets. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Luca Foschini 0002, John Hershberger 0001, Subhash Suri On the Complexity of Time-Dependent Shortest Paths. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Xavier Allamigeon On the Complexity of Strongly Connected Components in Directed Hypergraphs. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1George Christodoulou 0001, Katrina Ligett, Evangelia Pyrga Contention Resolution under Selfishness. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Christos Koufogiannakis, Neal E. Young A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Erik Krohn, Bengt J. Nilsson Approximate Guarding of Monotone and Rectilinear Polygons. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Longkun Guo, Hong Shen 0001 On Finding Min-Min Disjoint Paths. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý The Parameterized Complexity of Local Search for TSP, More Refined. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Lijun Chang, Jeffrey Xu Yu, Lu Qin 0001 Fast Maximal Cliques Enumeration in Sparse Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Adrian Dumitrescu, Minghui Jiang 0001 On the Largest Empty Axis-Parallel Box Amidst n Points. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christos Koufogiannakis, Neal E. Young Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen List Factoring and Relative Worst Order Analysis. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith Sublinear Algorithms for Approximating String Compressibility. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff Exact and Parameterized Algorithms for Max Internal Spanning Tree. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Minghui Jiang 0001 Recognizing d-Interval Graphs and d-Track Interval Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Huy Hoang Do, Wing-Kin Sung Compressed Directed Acyclic Word Graph with Application in Local Alignment. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Lukasz Jez A Universal Randomized Packet Scheduling Algorithm. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ioannis Caragiannis Efficient Coordination Mechanisms for Unrelated Machine Scheduling. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Kyriaki Ioannidou, Stavros D. Nikolopoulos The Longest Path Problem Is Polynomial on Cocomparability Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour Two-stage Robust Network Design with Exponential Scenarios. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Harish Chandran, Nikhil Gopalkrishnan, John H. Reif Tile Complexity of Approximate Squares. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
Displaying result #1401 - #1500 of 3466 (100 per page; Change: )
Pages: [<<][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19]
[20][21][22][23][24][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license