The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/conf/alenex

Publication years (Num. hits)
1999 (21) 2001 (19) 2002 (16) 2003 (15) 2006 (17) 2007 (16) 2008 (16) 2009 (17) 2010 (17) 2011 (17) 2012 (17) 2013 (16) 2014 (16) 2015 (16) 2016 (16) 2017 (22) 2018 (20) 2019 (18)
Publication types (Num. hits)
inproceedings(294) proceedings(18)
Venues (Conferences, Journals, ...)
ALENEX(312)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords

Results
Found 312 publication records. Showing 312 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch Batch-Parallel Euler Tour Trees. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Martin Aumüller 0001, Nikolaj Hass Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sebastian Schlag, Christian Schulz 0003, Daniel Seemaier, Darren Strash Scalable Edge Partitioning. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Romain Azaïs, Jean-Baptiste Durand, Christophe Godin Approximation of trees by self-nested trees. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stephen G. Kobourov, Henning Meyerhenke (eds.) Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Delling, Julian Dibbelt, Thomas Pajor Fast and Exact Public Transit Routing with Restricted Pareto Sets. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florian Barth, Stefan Funke, Sabine Storandt Alternative Multicriteria Routes. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Moritz Beck 0001, Kam-yiu Lam, Joseph Kee-Yin Ng, Sabine Storandt, Chun Jiang Zhu Concatenated k-Path Covers. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Johannes Fischer 0001, Florian Kurpicz Lightweight Distributed Suffix Array Construction. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sebastian Schlag, Matthias Schmitt, Christian Schulz 0003 Faster Support Vector Machines. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Julius Lischeid, Kitty Meeks, Martin Schirneck Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adalat Jabrayilov, Petra Mutzel A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sebastian Lamm, Christian Schulz 0003, Darren Strash, Robert Williger, Huashuo Zhang Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider SAT-Encodings for Treecut Width and Treedepth. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Dominik Krupke Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yihan Sun 0001, Guy E. Blelloch Parallel Range, Segment and Rectangle Queries with Augmented Maps. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thom Castermans, Bettina Speckmann, Kevin Verbeek A Practical Algorithm for Spatial Agglomerative Clustering. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stefan Edelkamp, Armin Weiß Worst-Case Efficient Sorting with QuickMergesort. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Héctor Ferrada, Dominik Kempa, Simon J. Puglisi Hybrid Indexing Revisited. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego Adaptive Cuckoo Filters. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Monika Henzinger, Alexander Noe, Christian Schulz 0003, Darren Strash Practical Minimum Cut Algorithms. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner A Geometric Heuristic for Rectilinear Crossing Minimization. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Anton Krohmer Hyperbolic Embeddings for Near-Optimal Greedy Routing. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jakob L. Andersen, Daniel Merkle A Generic Framework for Engineering Graph Canonization Algorithms. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Demian Hespe, Christian Schulz 0003, Darren Strash Scalable Kernelization for Maximum Independent Sets. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nirman Kumar, Stavros Sintos Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lars Arge, Yujin Shin, Constantinos Tsirogiannis Computing Floods Caused by Non-Uniform Sea-Level Rise. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Mendel Area-Preserving Subdivision Simplification with Topology Constraints: Exactly and in Practice. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Petteri Kaski Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Johannes Fischer 0001, Florian Kurpicz, Marvin Löbel Simple, Fast and Lightweight Parallel Wavelet Tree Construction. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke Scaling up Group Closeness Maximization. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rasmus Pagh, Suresh Venkatasubramanian (eds.) Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke Computing Top-k Closeness Centrality in Fully-dynamic Graphs. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Eppstein, Sariel Har-Peled, Gabriel Nivasch Grid peeling and the affine curve-shortening flow. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marc Hellmuth, Anders S. Knudsen, Michal Kotrbcík, Daniel Merkle, Nikolai Nøjgaard Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel A practical fpt algorithm for Flow Decomposition and transcript assembly. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders 0001, Sebastian Schlag Engineering a direct k-way Hypergraph Partitioning Algorithm. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stefan Funke, Thomas Mendel, Alexander Miller, Sabine Storandt, Maria Wiebe Map Simplification with Topology Constraints: Exactly and in Practice. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Hamann, Ulrich Meyer 0001, Manuel Penschuck, Dorothea Wagner I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi, Bella Zhukova Engineering External Memory Induced Suffix Sorting. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Johannes Fischer 0001, Florian Kurpicz, Peter Sanders 0001 Engineering a Distributed Full-Text Index. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Frank Staals, Constantinos Tsirogiannis Computing the Expected Value and Variance of Geometric Measures. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Simon Gog, Alistair Moffat, Matthias Petri CSA++: Fast Pattern Search for Large Alphabets. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andreas Poyias, Simon J. Puglisi, Rajeev Raman Compact Dynamic Rewritable (CDRW) Arrays. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano Computing Critical Nodes in Directed Graphs. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Bahrdt, Michael Becher, Stefan Funke, Filip Krumpe, André Nusser, Martin Seybold, Sabine Storandt Growing Balls in ℝd. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jouni Sirén Indexing Variation Graphs. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christopher Musco, Maxim Sviridenko, Justin Thaler Determining Tournament Payout Structures for Daily Fantasy Sports. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peyman Afshani, Mark de Berg, Henri Casanova, Benjamin Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis An Efficient Algorithm for the 1D Total Visibility-Index Problem. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Saverio Basso, Alberto Ceselli Asynchronous Column Generation. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Julian Labeit, Simon Gog Elias-Fano meets Single-Term Top-k Document Retrieval. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Preethi Lahoti, Patrick K. Nicholson, Bilyana Taneva Efficient Set Intersection Counting Algorithm for Text Similarity Measures. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Axtmann, Peter Sanders 0001 Robust Massively Parallel Sorting. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jan Dean Catarata, Scott Corbett, Harry Stern, Mario Szegedy, Tomás Vyskocil, Zheng Zhang The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry). Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Funke, Peter Sanders 0001 Parallel d-D Delaunay Triangulations in Shared and Distributed Memory. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lars Arge, Mathias Rav, Sarfraz Raza, Morten Revsbæk I/O-Efficient Event Based Depression Flood Risk. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Vijaya Ramachandran (eds.) Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Stein, Karsten Weihe, Augustin Wilberg, Roland Kluge, Julian M. Klomp, Mathias Schnee, Lin Wang, Max Mühlhäuser Distributed Graph-based Topology Adaptation using Motif Signatures. Search on Bibsonomy ALENEX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke Computing Top-k Closeness Centrality Faster in Unweighted Graphs. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir Real-Time k-bounded Preemptive Scheduling. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ulrich Meyer 0001, Manuel Penschuck Generating Massive Scale-Free Networks under Resource Constraints. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erik G. Boman, Kevin Deweese, John R. Gilbert An Empirical Comparison of Graph Laplacian Solvers. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis Engineering Oracles for Time-Dependent Road Networks. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sebastian Lamm, Peter Sanders 0001, Christian Schulz 0003, Darren Strash, Renato F. Werneck Finding Near-Optimal Independent Sets at Scale. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fabian Fuchs Experimental Evaluation of Distributed Node Coloring Algorithms for Wireless Networks. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders 0001, Christian Schulz 0003 k-way Hypergraph Partitioning via n-Level Recursive Bisection. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Edo Liberty, Ram Sriharsha, Maxim Sviridenko An Algorithm for Online K-Means Clustering. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Hamann, Ben Strasser Graph Bisection with Pareto-Optimization. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Kerber, Dmitriy Morozov, Arnur Nigmetov Geometry Helps to Compare Persistence Diagrams. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael T. Goodrich, Michael Mitzenmacher (eds.) Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016 Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Patrick Klitzke, Patrick K. Nicholson A General Framework for Dynamic Succinct and Compressed Data Structures. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Markus Blumenstock Fast Algorithms for Pseudoarboricity. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ruben Becker, Maximilian Fickert, Andreas Karrenbauer A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Hannah Bast, Matthias Hertel, Sabine Storandt Scalable Transfer Patterns. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Takuya Akiba, Yoichi Iwata Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Deepak Ajwani, Ulrich Meyer 0001, David Veith An I/O-efficient Distance Oracle for Evolving Real-World Graphs. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Matteo Ceccarello, Francesco Silvestri 0001 Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira Region-based Approximation Algorithms for Visibility between Imprecise Locations. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Andreas Björklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri Engineering Motif Search for Large Graphs. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Yaroslav Akhremtsev, Peter Sanders 0001, Christian Schulz 0003 (Semi-)External Algorithms for Graph Partitioning and Clustering. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt 0001, Julian Troegel Computing MaxMin Edge Length Triangulations. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam Cache Replacement with Memory Allocation. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Pierre Bertrand, Christoph Lenzen The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Yuzuru Okajima, Kouichi Maruyama Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis 2-Connectivity in Directed Graphs: An Experimental Study. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hongwei Huo, Longgang Chen, Heng Zhao, Jeffrey Scott Vitter, Yakov Nekrich, Qiang Yu 0003 A Data-Aware FM-index. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis Analysis and Experimental Evaluation of Time-Dependent Distance Oracles. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Simon Gog, Gonzalo Navarro Improved Single-Term Top-k Document Retrieval. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ulrik Brandes, David Eppstein (eds.) Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015 Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt Approximating Betweenness Centrality in Large Evolving Networks. Search on Bibsonomy ALENEX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Mark Ortmann, Ulrik Brandes Triangle Listing Algorithms: Back from the Diversion. Search on Bibsonomy ALENEX The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, Yuki Kawata Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. Search on Bibsonomy ALENEX The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Carsten Gutwenger, Petra Mutzel, Marcus Schaefer Practical Experience with Hanani-Tutte for Testing c-Planarity. Search on Bibsonomy ALENEX The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Benjamin A. Burton Enumerating fundamental normal surfaces: Algorithms, experiments and invariants. Search on Bibsonomy ALENEX The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Yuzuru Okajima Top-k Substring Matching for Auto-Completion. Search on Bibsonomy ALENEX The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Christoph Dürr, Óscar C. Vásquez Order constraints for single machine scheduling with non-linear cost. Search on Bibsonomy ALENEX The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ulrich Bauer, Michael Kerber, Jan Reininghaus Distributed Computation of Persistent Homology. Search on Bibsonomy ALENEX The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Hannah Bast, Sabine Storandt Flow-Based Guidebook Routing. Search on Bibsonomy ALENEX The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 312 (100 per page; Change: )
Pages: [1][2][3][4][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license