Norbert Zeh

Samuel Bruno da Silva Sousa

Comput. Geom., 2019

Categorizing Online Harassment on Twitter.

[BibT_eX]

[DOI]

Mozhgan Saeidi

Evangelos E. Milios

Lilian Berton

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

2018

Maximal and Convex Layers of Random Point Sets.

[BibT_eX]

[DOI]

Cuong P. Nguyen

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Improving Short Text Clustering by Similarity Matrix Sparsification.

[BibT_eX]

[DOI]

Md. Rashadul Hasan Rakib

Magdalena Jankowska

Evangelos E. Milios

Proceedings of the ACM Symposium on Document Engineering 2018, 2018

Polynomial-Time Algorithms for Phylogenetic Inference Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - 5th International Conference, 2018

2017

Parallel construction of succinct trees.

[BibT_eX]

[DOI]

José Fuentes-Sepúlveda

Leo Ferres

Theor. Comput. Sci., 2017

I/O-Efficient Path Traversal in Succinct Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

Computing Maximum Agreement Forests without Cluster Partitioning is Folly.

[BibT_eX]

[DOI]

Zhijiang Li

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

High-performance Computational Framework for Phrase Relatedness.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Symposium on Document Engineering, 2017

2016

I/O-Model.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Hybridization Number on Three Rooted Binary Trees is EPT.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Introduction to Special Issue ALENEX 2013.

[BibT_eX]

[DOI]

Peter Sanders

ACM J. Exp. Algorithmics, 2016

Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees.

[BibT_eX]

[DOI]

Algorithmica, 2016

2014

Hybridization Number on Three Trees.

[BibT_eX]

[DOI]

CoRR, 2014

Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries.

[BibT_eX]

[DOI]

Ganggui Tang

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Efficient Data Structures for Risk Modelling in Portfolios of Catastrophic Risk Using MapReduce.

[BibT_eX]

[DOI]

Zhimin Yao

Proceedings of the International Conference on Computational Science, 2014

2013

Fixed-Parameter Algorithms for Maximum Agreement Forests.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs.

[BibT_eX]

[DOI]

Freek van Walderveen

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Building a scalable spatial OLAP system.

[BibT_eX]

[DOI]

Oliver Baltzer

Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

QuPARA: Query-driven large-scale portfolio aggregate risk analysis on MapReduce.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2012

I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

A parallel buffer tree.

[BibT_eX]

[DOI]

Nodari Sitchinava

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

A Space-Efficient Framework for Dynamic Point Location.

[BibT_eX]

[DOI]

Patrick K. Nicholson

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

On the Advice Complexity of Buffer Management.

[BibT_eX]

[DOI]

Reza Dorrigiv

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Lower Bounds for Sorted Geometric Queries in the I/O Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

A topological sorting algorithm for large graphs.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2011

Low-interference networks in metric spaces of bounded doubling dimension.

[BibT_eX]

[DOI]

Michiel H. M. Smid

Inf. Process. Lett., 2011

Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space.

[BibT_eX]

[DOI]

Chris H. Hamilton

Discret. Comput. Geom., 2011

Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests

[BibT_eX]

[DOI]

CoRR, 2011

Improved Space Bounds for Cache-Oblivious Range Reporting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Ordered and Unordered Top-K Range Reporting in Large Data Sets.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors.

[BibT_eX]

[DOI]

Nodari Sitchinava

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Engineering a Topological Sorting Algorithm for Massive Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2010

A general approach for cache-oblivious range reporting and approximate range counting.

[BibT_eX]

[DOI]

Chris H. Hamilton

Comput. Geom., 2010

Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract).

[BibT_eX]

[DOI]

Nodari Sitchinava

Proceedings of the Algorithms, 2010

I/O-efficient computation of water flow across a terrain.

[BibT_eX]

[DOI]

Morten Revsbæk

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Geometric spanners with small chromatic number.

[BibT_eX]

[DOI]

Comput. Geom., 2009

I/O-Efficient Algorithms for Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2009

A Heuristic Strong Connectivity Algorithm for Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

A Unifying View on Approximation and FPT of Agreement Forests.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

Finding optimal parameters for edit distance based sequence classification is NP-hard.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, 2009

I/O and Space-Efficient Path Traversal in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Relaxed Gabriel Graphs.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

I/O-model.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

I/O-Efficient Planar Separators.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

I/O-efficient algorithms for computing planar geometric spanners.

[BibT_eX]

[DOI]

Michiel H. M. Smid

Comput. Geom., 2008

NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Cache-Oblivious Red-Blue Line Segment Intersection.

[BibT_eX]

[DOI]

Thomas Mølhave

Proceedings of the Algorithms, 2008

2007

Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions.

[BibT_eX]

Oliver Baltzer

J. Digit. Inf. Manag., 2007

A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths.

[BibT_eX]

[DOI]

Luca Allulli

Peter Lichodzijewski

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Parallel Computation of Skyline Queries.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual International Symposium on High Performance Computing Systems and Applications (HPCS 2007), 2007

Adaptive Tuple Differential Coding.

[BibT_eX]

[DOI]

Jean-Paul Deveaux

Proceedings of the Database and Expert Systems Applications, 18th International Conference, 2007

2006

Boundary-optimal Triangulation Flooding.

[BibT_eX]

[DOI]

Richard J. Nowakowski

Int. J. Comput. Geom. Appl., 2006

I/O-Efficient Well-Separated Pair Decomposition and Applications.

[BibT_eX]

[DOI]

Algorithmica, 2006

Politician's Firefighting.

[BibT_eX]

[DOI]

Allan E. Scott

Ulrike Stege

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Cache-Oblivious Planar Shortest Paths.

[BibT_eX]

[DOI]

Hema Jampala

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

I/O-Optimal Algorithms for Outerplanar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2004

Approximating geometric bottleneck shortest paths.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Connectivity of Graphs Under Edge Flips.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Rolf Fagerberg

Proceedings of the Algorithm Theory, 2004

2003

On External-Memory Planar Depth First Search.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2003

An external memory data structure for shortest path queries.

[BibT_eX]

[DOI]

David A. Hutchinson

Discret. Appl. Math., 2003

I/O-efficient topological sorting of planar DAGs.

[BibT_eX]

[DOI]

Laura Toma

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

I/O-Efficient Undirected Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

I/O-optimal algorithms for planar graphs using separators.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

I/O-Efficient Algorithms for Sparse Graphs.

[BibT_eX]

[DOI]

Laura Toma

Proceedings of the Algorithms for Memory Hierarchies, 2002

A Survey of Techniques for Designing I/O-Efficient Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Memory Hierarchies, 2002

On reverse nearest neighbor queries.

[BibT_eX]

[DOI]

Jan Vahrenhold

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

I/O-Efficient Shortest Path Queries in Geometric Spanners.

[BibT_eX]

[DOI]

Michiel H. M. Smid

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

On Finding Minimum Deadly Sets for Directed Networks.

[BibT_eX]

Nicola Santoro

Proceedings of the SIROCCO 8, 2001

I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.

[BibT_eX]

[DOI]

Tamás Lukovszki

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000

I/O-Efficient Well-Separated Pair Decomposition and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

External Memory Algorithms for Outerplanar Graphs.

[BibT_eX]

[DOI]