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
1Jesper Nederlof Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1David Doty, Lila Kari, Benoît Masson Negative Interactions in Irreversible Self-assembly. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr Inequalities for the Number of Walks in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ferdinando Cicalese, Ely Porat Guest Editorial for "Group Testing: models and applications". Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal 0001, Joel Spencer Deterministic Discrepancy Minimization. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Dániel Marx, Ildikó Schlotter Cleaning Interval Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Gábor Wiener Rounds in Combinatorial Search. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Bhaskar DasGupta, S. Muthukrishnan 0001 Stochastic Budget Optimization in Internet Advertising. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh PASS Approximation: A Framework for Analyzing and Designing Heuristics. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hung Q. Ngo 0001, Duong Hieu Phan, David Pointcheval Black-Box Trace&Revoke Codes. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Shayan Oveis Gharan, Jan Vondrák On Variants of the Matroid Secretary Problem. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1M. Praveen Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann 0001, Stephen G. Kobourov Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Chris Calabro, Russell Impagliazzo, Ramamohan Paturi On the Exact Complexity of Evaluating Quantified k -CNF. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Chaoyi Pang, Qing Zhang 0001, Xiaofang Zhou 0001, David P. Hansen, Sen Wang 0001, Anthony J. Maeder Computing Unrestricted Synopses Under Maximum Error Bound. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Moshe Hershcovitch, Haim Kaplan I/O Efficient Dynamic Data Structures for Longest Prefix Queries. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch Two New Perspectives on Multi-Stage Group Testing. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sylvain Guillemot, Florian Sikora Finding and Counting Vertex-Colored Subtrees. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Steven M. Kautz, Brad Shutters Self-Assembling Rulers for Approximating Generalized Sierpinski Carpets. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Bang Ye Wu A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai On Total Unimodularity of Edge-Edge Adjacency Matrices. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jérémie Chalopin, Shantanu Das 0001, Yann Disser, Matús Mihalák, Peter Widmayer Mapping Simple Polygons: How Robots Benefit from Looking Back. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Hannes Moser, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar The Parameterized Complexity of Unique Coverage and Its Variants. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Alfredo García Olaverri, Pedro Jodrá, Javier Tejel Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Benjamin A. Burton, Melih Ozlen A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz Unbounded Contention Resolution in Multiple-Access Channels. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Elias Koutsoupias, Angelina Vidali A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler The Parallel Complexity of Graph Canonization Under Abelian Group Action. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Graham Cormode, Michael Mitzenmacher, Justin Thaler Streaming Graph Computations with a Helpful Advisor. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Chien-Chung Huang, Zoya Svitkina Donation Center Location Problem. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Katharina T. Huber, Vincent Moulton Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono 0001, Hisao Tamaki, Ryuhei Uehara Route-Enabling Graph Orientation Problems. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Danny Z. Chen, Haitao Wang 0001 Approximating Points by a Piecewise Linear Function. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Avivit Lazar, Arie Tamir Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Fabrizio Grandoni 0001, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh 0001 Computing Optimal Steiner Trees in Polynomial Space. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Venkatesh Raman 0001, Saket Saurabh 0001 Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michael Huber 0002 Efficient Two-Stage Group Testing Algorithms for Genetic Screening. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ning Chen 0005, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh Improved Approximation Algorithms for the Spanning Star Forest Problem. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Vladimir Pestov Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Osamu Watanabe 0001 Message Passing Algorithms for MLS-3LIN Problem. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jesper Jansson 0001, Wing-Kin Sung Constructing the R* Consensus Tree of Two Trees in Subcubic Time. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Yang Xiang How to Use Spanning Trees to Navigate in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hsien-Kuei Hwang, Conrado Martínez, Robert Sedgewick Guest Editorial. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Narayan Vikas Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Shoshana Neuburger, Dina Sokol Succinct 2D Dictionary Matching. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler External-Memory Multimaps. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yaw-Ling Lin, Charles B. Ward, Steven Skiena Synthetic Sequence Design for Signal Location Search. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Lauri Ahlroth, Olli Pottonen, André Schumacher Approximately Uniform Online Checkpointing with Bounded Memory. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Paolo Ferragina, Jouni Sirén, Rossano Venturini Distribution-Aware Compressed Full-Text Indexes. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma Median Trajectories. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ali Çivril, Malik Magdon-Ismail Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1MohammadHossein Bateni, Julia Chuzhoy Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Frédéric Havet, Leonardo Sampaio Rocha On the Grundy and b-Chromatic Numbers of a Graph. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Kuan-Yu Chen, Kun-Mao Chao A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin Online Clustering with Variable Sized Clusters. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1David Peleg, Liam Roditty Relaxed Spanners for Directed Disk Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michael Drmota, Konstantinos Panagiotou A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Pim van 't Hof, Yngve Villanger Proper Interval Vertex Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Camil Demetrescu, Magnús M. Halldórsson Editorial. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Quentin F. Stout Isotonic Regression via Partitioning. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann Unified Compression-Based Acceleration of Edit-Distance Computation. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Satoru Iwata 0001, Mizuyo Takamatsu Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Mahdi Cheraghchi Improved Constructions for Non-adaptive Threshold Group Testing. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez 0001 On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Frank Neumann 0001 Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Chung-Shou Liao, D. T. Lee Power Domination in Circular-Arc Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ching-Chi Lin, Gen-Huey Chen, Gerard J. Chang A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Leslie Ann Goldberg Adaptive Drift Analysis. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ahmed Helmi 0001, Alois Panholzer Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1 Editorial Note. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Surender Baswana, Neelesh Khanna Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Thomas Sauerwald, Alexandre Stauffer Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ke Yi 0001, Qin Zhang 0001 Optimal Tracking of Distributed Heavy Hitters and Quantiles. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 Derandomizing the HSSW Algorithm for 3-SAT. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou 0001 On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin Motion Planning via Manifold Samples. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Stephan G. Wagner Asymptotic Enumeration of Extensional Acyclic Digraphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström Parameterized Two-Player Nash Equilibrium. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ely Porat, Liam Roditty Preprocess, Set, Query! Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Radu Mihaescu, Cameron Hill, Satish Rao Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto Guest Editorial: Selected Papers from ISAAC 2011. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak Collecting Weighted Items from a Dynamic Queue. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Raphael Yuster Maximum Matching in Regular and Almost Regular Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis Improved Bounds for Finger Search on a RAM. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità The School Bus Problem on Trees. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Takehiro Ito, Takao Nishizeki, Michael Schröder 0001, Takeaki Uno, Xiao Zhou 0001 Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond Interval Partitions and Polynomial Factorization. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff 0001 Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Qi Ge, Daniel Stefankovic The Complexity of Counting Eulerian Tours in 4-regular Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kyung-Yong Chwa, Kunsoo Park Guest Editorial: Special Issue on Algorithms and Computation. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Qian-Ping Gu, Hisao Tamaki Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael L. Fredman Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christian A. Duncan, Emden R. Gansner, Yifan Hu 0001, Michael Kaufmann 0001, Stephen G. Kobourov Optimal Polygonal Representation of Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
Displaying result #1501 - #1600 of 3466 (100 per page; Change: )
Pages: [<<][6][7][8][9][10][11][12][13][14][15][16][17][18][19]
[20][21][22][23][24][25][>>]
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