Deepak Ajwani

Orcid: 0000-0001-7269-4150

Affiliations:
  • University College Dublin, Ireland
  • Nokia Bell Labs, Dublin, Ireland (former)
  • Alcatel-Lucent Bell Labs, Dublin, Ireland (former)
  • Saarland University, Saarbrücken, Germany (PhD 2008)


According to our database1, Deepak Ajwani authored at least 60 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Foreword.
Proceedings of the 11th International Network Optimization Conference, 2024

Learning to Prune Instances of Steiner Tree Problem in Graphs.
Proceedings of the 11th International Network Optimization Conference, 2024

2023
Learning fine-grained search space pruning and heuristics for combinatorial optimization.
J. Heuristics, 2023

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).
Dagstuhl Reports, 2023

Open Problems in (Hyper)Graph Decomposition.
CoRR, 2023

Learning to Prune Electric Vehicle Routing Problems.
Proceedings of the Learning and Intelligent Optimization - 17th International Conference, 2023

2022
Learning to Prune Instances of Steiner Tree Problem in Graphs.
CoRR, 2022

Learning to Prune Instances of <i>k</i>-median and Related Problems.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021
Learning to Sparsify Travelling Salesman Problem Instances.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

2020
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries.
Proc. VLDB Endow., 2020

Creating and Characterising Electricity Load Profiles of Residential Buildings.
Proceedings of the Advanced Analytics and Learning on Temporal Data, 2020

Towards Quantifying the Distance between Opinions.
Proceedings of the Fourteenth International AAAI Conference on Web and Social Media, 2020

2019
Automated assessment of knowledge hierarchy evolution: comparing directed acyclic graphs.
Inf. Retr. J., 2019

Learning Multi-Stage Sparsification for Maximum Clique Enumeration.
CoRR, 2019

Engineering a Parallel Δ-stepping Algorithm.
Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018
Prioritized Relationship Analysis in Heterogeneous Information Networks.
ACM Trans. Knowl. Discov. Data, 2018

Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Enriching Taxonomies With Functional Domain Knowledge.
Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, 2018

Automated Knowledge Hierarchy Assessment.
Proceedings of the Joint Proceedings of the First International Workshop on Professional Search (ProfS2018); the Second Workshop on Knowledge Graphs and Semantics for Text Retrieval, 2018

An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores.
Proceedings of the 47th International Conference on Parallel Processing, 2018

Efficient Auto-Generation of Taxonomies for Structured Knowledge Discovery and Organization.
Proceedings of the 29th on Hypertext and Social Media, 2018

Average-Case Behavior of k-Shortest Path Algorithms.
Proceedings of the Complex Networks and Their Applications VII, 2018

ANNOTATE: orgANizing uNstructured cOntenTs viA Topic labEls.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

2017
Breaking Cycles In Noisy Hierarchies.
Proceedings of the 2017 ACM on Web Science Conference, 2017

Scalable Disambiguation System Capturing Individualities of Mentions.
Proceedings of the Language, Data, and Knowledge - First International Conference, 2017

2016
Co-optimizing application partitioning and network topology for a reconfigurable interconnect.
J. Parallel Distributed Comput., 2016

Distributed Entity Disambiguation with Per-Mention Learning.
CoRR, 2016

What Links Alice and Bob?: Matching and Ranking Semantic Patterns in Heterogeneous Networks.
Proceedings of the 25th International Conference on World Wide Web, 2016

2015
Processing Large Graphs: Representations, Storage, Systems and Algorithms.
Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Profiling User Activities with Minimal Traffic Traces.
Proceedings of the Engineering the Web in the Big Data Era - 15th International Conference, 2015

An I/O-efficient Distance Oracle for Evolving Real-World Graphs.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
A Geometric Distance Oracle for Large Real-World Graphs.
CoRR, 2014

Analysis of the semi-synchronous approach to large-scale parallel community finding.
Proceedings of the second ACM conference on Online social networks, 2014

2013
Generating synthetic task graphs for simulating stream computing systems.
J. Parallel Distributed Comput., 2013

Seeds for a Heterogeneous Interconnect.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

A Network Configuration Algorithm Based on Optimization of Kirchhoff Index.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors.
Discret. Comput. Geom., 2012

Graph Partitioning for Reconfigurable Topology.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

I/O-efficient Hierarchical Diameter Approximation.
Proceedings of the Algorithms - ESA 2012, 2012

I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study.
Proceedings of the ARCS 2012 Workshops, 28. Februar - 2. März 2012, München, Germany, 2012

2011
A topological sorting algorithm for large graphs.
ACM J. Exp. Algorithmics, 2011

A Flexible Workload Generator for Simulating Stream Computing Systems.
Proceedings of the MASCOTS 2011, 2011

I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Engineering a Topological Sorting Algorithm for Massive Graphs.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010
Average-case analysis of incremental topological ordering.
Discret. Appl. Math., 2010

Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract).
Proceedings of the Algorithms, 2010

Realistic Computer Models.
Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009
On Computational Models for Flash Memory Devices.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Design and Engineering of External Memory Traversal Algorithms for General Graphs.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008
Traversing large graphs in realistic settings.
PhD thesis, 2008

An <i>O</i>(<i>n</i><sup>2.75</sup>) algorithm for incremental topological ordering.
ACM Trans. Algorithms, 2008

Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007
On Computing the Centroid of the Vertices of an Arrangement and Related Problems.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Conflict-free coloring for rectangle ranges using <i>O</i>(<i>n</i><sup>.382</sup>) colors.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Average-Case Analysis of Online Topological Ordering.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Improved External Memory BFS Implementation.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006
An O(n<sup>2.75</sup>) algorithm for online topological ordering.
Electron. Notes Discret. Math., 2006

A computational study of external-memory BFS algorithms.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Breadth First Search on Massive Graphs.
Proceedings of the Shortest Path Problem, 2006


  Loading...