Breadth First Search on Massive Graphs. - Deepak Ajwani; Ulrich Meyer 001; Vitaly Osipov (The Shortest Path Problem, 2006)

A computational study of external-memory BFS algorithms. - Deepak Ajwani; Roman Dementiev; Ulrich Meyer 001 (SODA, 2006)

An O(n2.75) algorithm for online topological ordering. - Deepak Ajwani; Tobias Friedrich 001; Ulrich Meyer 001 (Electron. Notes Discret. Math., 2006)

Improved External Memory BFS Implementation. - Deepak Ajwani; Ulrich Meyer 001; Vitaly Osipov (ALENEX, 2007)

Average-Case Analysis of Online Topological Ordering. - Deepak Ajwani; Tobias Friedrich 001 (ISAAC, 2007)

Conflict-free coloring for rectangle ranges using O(n.382) colors. - Deepak Ajwani; Khaled M. Elbassioni; Sathish Govindarajan; Saurabh Ray (SPAA, 2007)

On Computing the Centroid of the Vertices of an Arrangement and Related Problems. - Deepak Ajwani; Saurabh Ray; Raimund Seidel; Hans Raj Tiwary (WADS, 2007)

Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. - Deepak Ajwani; Itay Malinger; Ulrich Meyer 001; Sivan Toledo (WEA, 2008)

An O(n2.75) algorithm for incremental topological ordering. - Deepak Ajwani; Tobias Friedrich 001; Ulrich Meyer 001 (ACM Trans. Algorithms, 2008)

Traversing large graphs in realistic settings. - Deepak Ajwani (2008)

Design and Engineering of External Memory Traversal Algorithms for General Graphs. - Deepak Ajwani; Ulrich Meyer 001 (Algorithmics of Large and Complex Networks, 2009)

On Computational Models for Flash Memory Devices. - Deepak Ajwani; Andreas Beckmann; Riko Jacob; Ulrich Meyer 001; Gabriel Moruz (SEA, 2009)

Realistic Computer Models. - Deepak Ajwani; Henning Meyerhenke (Algorithm Engineering, 2010)

Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). - Deepak Ajwani; Nodari Sitchinava; Norbert Zeh (ESA (2), 2010)

Average-case analysis of incremental topological ordering. - Deepak Ajwani; Tobias Friedrich 001 (Discret. Appl. Math., 2010)

Engineering a Topological Sorting Algorithm for Massive Graphs. - Deepak Ajwani; Adan Cosgaya-Lozano; Norbert Zeh (ALENEX, 2011)

I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors. - Deepak Ajwani; Nodari Sitchinava; Norbert Zeh (IPDPS, 2011)

A Flexible Workload Generator for Simulating Stream Computing Systems. - Deepak Ajwani; Shoukat Ali; Kostas Katrinis; Cheng-Hong Li; Alfred J. Park; John P. Morrison; Eugen Schenfeld (MASCOTS, 2011)

A topological sorting algorithm for large graphs. - Deepak Ajwani; Adan Cosgaya-Lozano; Norbert Zeh (ACM J. Exp. Algorithmics, 2011)

I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. - Deepak Ajwani; Andreas Beckmann; Ulrich Meyer 001; David Veith (ARCS Workshops, 2012)

I/O-efficient Hierarchical Diameter Approximation. - Deepak Ajwani; Ulrich Meyer 001; David Veith (ESA, 2012)

Graph Partitioning for Reconfigurable Topology. - Deepak Ajwani; Shoukat Ali; John P. Morrison (IPDPS, 2012)

Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors. - Deepak Ajwani; Khaled M. Elbassioni; Sathish Govindarajan; Saurabh Ray (Discret. Comput. Geom., 2012)

Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures. - Deepak Ajwani; Nodari Sitchinava (ESA, 2013)

A Network Configuration Algorithm Based on Optimization of Kirchhoff Index. - Adam Hackett; Deepak Ajwani; Shoukat Ali; Steve Kirkland; John P. Morrison (IPDPS, 2013)

Seeds for a Heterogeneous Interconnect. - Adam Hackett; Deepak Ajwani; Shoukat Ali; Steve Kirkland; John P. Morrison (IPDPS Workshops, 2013)

Generating synthetic task graphs for simulating stream computing systems. - Deepak Ajwani; Shoukat Ali; Kostas Katrinis; Cheng-Hong Li; Alfred J. Park; John P. Morrison; Eugen Schenfeld (J. Parallel Distributed Comput., 2013)

Analysis of the semi-synchronous approach to large-scale parallel community finding. - Erika Duriakova; Neil Hurley; Deepak Ajwani; Alessandra Sala (COSN, 2014)

A Geometric Distance Oracle for Large Real-World Graphs. - Deepak Ajwani; W. Sean Kennedy; Alessandra Sala; Iraj Saniee (CoRR, 2014)

An I/O-efficient Distance Oracle for Evolving Real-World Graphs. - Deepak Ajwani; Ulrich Meyer 001; David Veith (ALENEX, 2015)

Profiling User Activities with Minimal Traffic Traces. - Tiep Mai; Deepak Ajwani; Alessandra Sala (ICWE, 2015)

Processing Large Graphs: Representations, Storage, Systems and Algorithms. - Deepak Ajwani; Marcel Karnstedt; Alessandra Sala (WWW (Companion Volume), 2015)

What Links Alice and Bob?: Matching and Ranking Semantic Patterns in Heterogeneous Networks. - Jiongqian Liang; Deepak Ajwani; Patrick K. Nicholson; Alessandra Sala; Srinivasan Parthasarathy 001 (WWW, 2016)

Distributed Entity Disambiguation with Per-Mention Learning. - Tiep Mai; Bichen Shi; Patrick K. Nicholson; Deepak Ajwani; Alessandra Sala (CoRR, 2016)

Co-optimizing application partitioning and network topology for a reconfigurable interconnect. - Deepak Ajwani; Adam Hackett; Shoukat Ali; John P. Morrison; Stephen Kirkland (J. Parallel Distributed Comput., 2016)

Scalable Disambiguation System Capturing Individualities of Mentions. - Tiep Mai; Bichen Shi; Patrick K. Nicholson; Deepak Ajwani; Alessandra Sala (LDK, 2017)

Breaking Cycles In Noisy Hierarchies. - Jiankai Sun; Deepak Ajwani; Patrick K. Nicholson; Alessandra Sala; Srinivasan Parthasarathy 001 (WebSci, 2017)

ANNOTATE: orgANizing uNstructured cOntenTs viA Topic labEls. - Deepak Ajwani; Bilyana Taneva; Sourav Dutta 001; Patrick K. Nicholson; Ghasem Heyrani-Nobari; Alessandra Sala (IEEE BigData, 2018)

Average-Case Behavior of k-Shortest Path Algorithms. - Alexander Schickedanz; Deepak Ajwani; Ulrich Meyer 001; Pawel Gawrychowski (COMPLEX NETWORKS (1), 2018)

Efficient Auto-Generation of Taxonomies for Structured Knowledge Discovery and Organization. - Deepak Ajwani; Sourav Dutta 001; Patrick K. Nicholson; Luca Maria Aiello; Alessandra Sala (HT, 2018)

An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores. - Deepak Ajwani; Erika Duriakova; Neil Hurley; Ulrich Meyer 001; Alexander Schickedanz (ICPP, 2018)

Automated Knowledge Hierarchy Assessment. - Guruprasad Nayak; Sourav Dutta 001; Deepak Ajwani; Patrick K. Nicholson; Alessandra Sala (ProfS/KG4IR/Data:Search@SIGIR, 2018)

Enriching Taxonomies With Functional Domain Knowledge. - Nikhita Vedula; Patrick K. Nicholson; Deepak Ajwani; Sourav Dutta 001; Alessandra Sala; Srinivasan Parthasarathy 001 (SIGIR, 2018)

Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs. - Xiaofeng Yang; Deepak Ajwani; Wolfgang Gatterbauer; Patrick K. Nicholson; Mirek Riedewald; Alessandra Sala (WWW, 2018)

Prioritized Relationship Analysis in Heterogeneous Information Networks. - Jiongqian Liang; Deepak Ajwani; Patrick K. Nicholson; Alessandra Sala; Srinivasan Parthasarathy 001 (ACM Trans. Knowl. Discov. Data, 2018)

Engineering a Parallel Δ-stepping Algorithm. - Erika Duriakova; Deepak Ajwani; Neil Hurley (IEEE BigData, 2019)

Learning Multi-Stage Sparsification for Maximum Clique Enumeration. - Marco Grassia; Juho Lauri; Sourav Dutta 001; Deepak Ajwani (CoRR, 2019)

Automated assessment of knowledge hierarchy evolution: comparing directed acyclic graphs. - Guruprasad Nayak; Sourav Dutta 001; Deepak Ajwani; Patrick K. Nicholson; Alessandra Sala (Inf. Retr. J., 2019)

Towards Quantifying the Distance between Opinions. - Saket Gurukar; Deepak Ajwani; Sourav Dutta 001; Juho Lauri; Srinivasan Parthasarathy 001; Alessandra Sala (ICWSM, 2020)

Creating and Characterising Electricity Load Profiles of Residential Buildings. - James Fitzpatrick; Paula Carroll; Deepak Ajwani (AALTD@PKDD/ECML, 2020)

Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. - Nikolaos Tziavelis; Deepak Ajwani; Wolfgang Gatterbauer; Mirek Riedewald; Xiaofeng Yang (Proc. VLDB Endow., 2020)

Learning to Sparsify Travelling Salesman Problem Instances. - James Fitzpatrick; Deepak Ajwani; Paula Carroll (CPAIOR, 2021)

Learning to Prune Instances of k-median and Related Problems. - Dena Tayebi; Saurabh Ray; Deepak Ajwani (ALENEX, 2022)

Learning to Prune Instances of Steiner Tree Problem in Graphs. - Jiwei Zhang 013; Deepak Ajwani (CoRR, 2022)

Learning to Prune Electric Vehicle Routing Problems. - James Fitzpatrick; Deepak Ajwani; Paula Carroll (LION, 2023)

Open Problems in (Hyper)Graph Decomposition. - Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; Tobias Heuer; George Karypis; Kamer Kaya; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; Darren Strash; Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; et al. (Dagstuhl Reports, 2023)

Learning fine-grained search space pruning and heuristics for combinatorial optimization. - Juho Lauri; Sourav Dutta 001; Marco Grassia; Deepak Ajwani (J. Heuristics, 2023)

An Improved Genetic Algorithm for Set Cover using Rosenthal Potential. - Dena Tayebi; Saurabh Ray; Deepak Ajwani (FedCSIS, 2024)

Learning to Prune Instances of Steiner Tree Problem in Graphs. - Jiwei Zhang 013; Dena Tayebi; Saurabh Ray; Deepak Ajwani (INOC, 2024)

Foreword. - Paula Carroll; Deepak Ajwani (INOC, 2024)

Effectiveness of SDP Rounding Using Hopfield Networks. - Éanna Curran; Saurabh Ray; Deepak Ajwani (LoG, 2024)

A scalable learning approach for the capacitated vehicle routing problem. - James Fitzpatrick; Deepak Ajwani; Paula Carroll (Comput. Oper. Res., 2024)

Machine Learning Augmented Algorithms for Combinatorial Optimization Problems (Dagstuhl Seminar 24441). - Deepak Ajwani; Bistra Dilkina; Tias Guns; Ulrich Carsten Meyer (Dagstuhl Reports, 2024)