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
1Vadim E. Levit, David Tankus Complexity Results for Generating Subgraphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara Stabbing Circles for Sets of Segments in the Plane. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Grimmer Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Davide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti Fault-Tolerant Approximate Shortest-Path Trees. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hiroshi Hirai 0001, Hiroyuki Namba Shortest (A+B)-Path Packing Via Hafnian. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Franz J. Brandenburg Recognizing Optimal 1-Planar Graphs in Linear Time. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Dusan Knop Parameterized Complexity of Length-bounded Cuts and Multicuts. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Maurice Chandoo Canonical Representations for Circular-Arc Graphs Using Flip Sets. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pål Grønås Drange, Michal Pilipczuk A Polynomial Kernel for Trivially Perfect Editing. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Katherine Edwards, W. Sean Kennedy, Iraj Saniee Fast Approximation Algorithms for p-Centers in Large $$\delta $$ δ -Hyperbolic Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sariel Har-Peled, Nirman Kumar Robust Proximity Search for Balls Using Sublinear Space. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hassan AbouEisha, Shahid Hussain 0004, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev Upper Domination: Towards a Dichotomy Through Boundary Properties. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Tobias Friedrich 0001, Anton Krohmer De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jessica A. Enright, Kitty Meeks Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Wenchang Luo, Yao Xu, Boyuan Gu, Weitian Tong, Randy Goebel, Guohui Lin Algorithms for Communication Scheduling in Data Gathering Network with Data Compression. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski Complexity of Token Swapping and Its Variants. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Furcy, Scott M. Summers Optimal Self-Assembly of Finite Shapes at Temperature 1 in 3D. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pietro S. Oliveto, Tiago Paixão, Jorge Pérez Heredia, Dirk Sudholt, Barbora Trubenová How to Escape Local Optima in Black Box Optimisation: When Non-elitism Outperforms Elitism. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Koyo Hayashi, Satoru Iwata 0001 Counting Minimum Weight Arborescences. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Sanjukta Roy Stable Matching Games: Manipulation via Subgraph Isomorphism. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth Tree Compression Using String Grammars. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sander P. A. Alewijnse, Kevin Buchin, Maike Buchin, Stef Sijben, Michel A. Westenberg Model-Based Segmentation and Classification of Trajectories. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Carola Doerr, Timo Kötzing Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Anton Krohmer Cliques in Hyperbolic Random Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martijn van Ee, René Sitters The A Priori Traveling Repairman Problem. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Frédéric Giroire, Frédéric Havet, Joanna Moulierac On the Complexity of Compressing Two Dimensional Routing Tables with Order. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Katharina T. Huber, Guillaume E. Scholz Beyond Representing Orthology Relations by Trees. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena 0001, Igor E. Shparlinski Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mohammad Ali Abam Spanners for Geodesic Graphs and Visibility Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Meng He 0001, J. Ian Munro, Gelin Zhou Dynamic Path Queries in Linear Space. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Carola Doerr, Johannes Lengler The (1+1) Elitist Black-Box Complexity of LeadingOnes. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Xiaocheng Hu, Yufei Tao 0001, Yi Yang 0029, Shuigeng Zhou Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth Routing in Unit Disk Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid Geometric Path Problems with Violations. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre 0001, Ioan Todinca Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yun Deng, David Fernández-Baca Fast Compatibility Testing for Rooted Phylogenetic Trees. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefan Felsner, Alexander Pilz Ham-Sandwich Cuts for Abstract Order Types. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cristina Bazgan, Janka Chlebíková, Thomas Pontoizeau Structural and Algorithmic Properties of 2-Community Structures. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid Spanning Trees in Multipartite Geometric Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peng Zhang 0008, Bin Fu, Linqing Tang Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ali Dehghan 0001, Mohammad-Reza (Rafsanjani) Sadeghi, Arash Ahadi Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Floderus, Jesper Jansson 0001, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu 3D Rectangulations and Geometric Matrix Multiplication. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Seok-Hee Hong 0001 Editorial: Special Issue on Algorithms and Computation. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Riley Murray, Samir Khuller, Megan Chao Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Naoyuki Kamiyama A Note on Submodular Function Minimization with Covering Type Linear Constraints. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ildikó Schlotter, Katarína Cechlárová A Connection Between Sports and Matroids: How Many Teams Can We Beat? Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1R. Krithika 0001, Abhishek Sahu, Prafullkumar Tale Dynamic Parameterized Problems. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shahin Kamali Compact Representation of Graphs of Small Clique-Width. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Diptapriyo Majumdar, Venkatesh Raman 0001 Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou Lift-and-Project Methods for Set Cover and Knapsack. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1 Editor's Note: Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ghurumuruhan Ganesan Stretch and Diameter in Random Geometric Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Markus Lohrey, Sebastian Maneth, Carl Philipp Reh Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu 0001 Improved Bounds in Stochastic Matching and Optimization. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chih-Hung Liu 0001, Sandro Montanari Minimizing the Diameter of a Spanning Tree for Imprecise Points. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos An O(log OPT)-Approximation for Covering and Packing Minor Models of θr. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Yael Hitron The Ordered Covering Problem. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Zaixin Lu, Donghyun Kim 0001 Guest Editorial: Special Issue on Combinatorial Optimization and Applications. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Annette Karrer, Ignaz Rutter Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Prosenjit Bose, Darryl Hill, Michiel H. M. Smid Improved Spanning Ratio for Low Degree Plane Spanners. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam The Subset Assignment Problem for Data Placement in Caches. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Carlo Comin, Romeo Rizzi An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peyman Afshani, Konstantinos Tsakalidis Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Victor A. Campos, Ana Silva 0001 Edge-b-Coloring Trees. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart The Induced Separation Dimension of a Graph. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Solving Problems on Graphs of High Rank-Width. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tim Nonner Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Hirotaka Ono 0001, Yota Otachi Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir A Theory and Algorithms for Combinatorial Reoptimization. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Maria Chudnovsky, Celina M. H. de Figueiredo, Sophie Spirkl The Sandwich Problem for Decompositions and Almost Monotone Properties. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Travis Gagie, Gonzalo Navarro 0001 Guest Editorial: Special Issue on Compact Data Structures. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andrei Lissovoi, Carsten Witt The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eun Jung Kim 0002, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos An FPT 2-Approximation for Tree-Cut Decomposition. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christopher S. Martin, Mohammad R. Salavatipour Minimizing Latency of Capacitated k-Tours. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ashwin Arulselvan, Ágnes Cseh, Martin Groß 0001, David F. Manlove, Jannik Matuschke Matchings with Lower Quotas: Algorithms and Complexity. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jiawei Qian, Seeun William Umboh, David P. Williamson Online Constrained Forest and Prize-Collecting Network Design. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Saket Saurabh 0001, Meirav Zehavi $$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi Bounded-Hop Communication Networks. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath On the Planar Split Thickness of Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar 0001 Sampling in Space Restricted Settings. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Giuseppe Persiano Metastability of Logit Dynamics for Coordination Games. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Syed Mohammad Meesum, Saket Saurabh 0001 Rank Reduction of Oriented Graphs by Vertex and Edge Deletions. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kamal Al-Bawani, Matthias Englert, Matthias Westermann Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Till Bruckdorfer, Stefan Felsner, Michael Kaufmann 0001 Planar Bus Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris Near-Optimal Asymmetric Binary Matrix Partitions. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Milanic, Irena Penev, Nicolas Trotignon Stable Sets in {ISK4, wheel}-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi Finding Pairwise Intersections Inside a Query Range. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Niedermann, Jan-Henrik Haunert An Algorithmic Framework for Labeling Network Maps. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Julian Arz, Johannes Fischer 0001 Lempel-Ziv-78 Compressed String Dictionaries. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Wing-Kai Hon, Tak Wah Lam, Rahul Shah 0001, Sharma V. Thankachan, Hing-Fung Ting, Yilin Yang Dictionary Matching with a Bounded Gap in Pattern or in Text. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
Displaying result #801 - #900 of 3466 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][>>]
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