default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDeepak Ajwani
Person information
- affiliation: University College Dublin, Ireland
- affiliation (former): Nokia Bell Labs, Dublin, Ireland
- affiliation (former): Alcatel-Lucent Bell Labs, Dublin, Ireland
- affiliation (PhD 2008): Saarland University, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]James Fitzpatrick
, Deepak Ajwani, Paula Carroll:
A scalable learning approach for the capacitated vehicle routing problem. Comput. Oper. Res. 171: 106787 (2024)- [c44]Dena Tayebi, Saurabh Ray, Deepak Ajwani:
An Improved Genetic Algorithm for Set Cover using Rosenthal Potential. FedCSIS 2024: 689-694 - [c43]Paula Carroll, Deepak Ajwani:
Foreword. INOC 2024: 1-3 - [c42]Jiwei Zhang, Dena Tayebi, Saurabh Ray, Deepak Ajwani:
Learning to Prune Instances of Steiner Tree Problem in Graphs. INOC 2024: 40-45 - [e1]Paula Carroll, Deepak Ajwani:
Proceedings of the 11th International Network Optimization Conference, INOC 2024, Dublin, Ireland, March 11-23, 2024. OpenProceedings.org 2024, ISBN 978-3-89318-096-7 [contents] - 2023
- [j11]Juho Lauri, Sourav Dutta, Marco Grassia, Deepak Ajwani:
Learning fine-grained search space pruning and heuristics for combinatorial optimization. J. Heuristics 29(2-3): 313-347 (2023) - [c41]James Fitzpatrick, Deepak Ajwani, Paula Carroll:
Learning to Prune Electric Vehicle Routing Problems. LION 2023: 378-392 - [i15]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, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i14]George Karypis, Christian Schulz, 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, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [c40]Dena Tayebi, Saurabh Ray, Deepak Ajwani:
Learning to Prune Instances of k-median and Related Problems. ALENEX 2022: 184-194 - [i13]Jiwei Zhang, Deepak Ajwani:
Learning to Prune Instances of Steiner Tree Problem in Graphs. CoRR abs/2208.11985 (2022) - 2021
- [c39]James Fitzpatrick, Deepak Ajwani, Paula Carroll:
Learning to Sparsify Travelling Salesman Problem Instances. CPAIOR 2021: 410-426 - [i12]James Fitzpatrick, Deepak Ajwani, Paula Carroll:
Learning to Sparsify Travelling Salesman Problem Instances. CoRR abs/2104.09345 (2021) - 2020
- [j10]Nikolaos Tziavelis, Deepak Ajwani, Wolfgang Gatterbauer, Mirek Riedewald, Xiaofeng Yang:
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. Proc. VLDB Endow. 13(9): 1582-1597 (2020) - [c38]Saket Gurukar, Deepak Ajwani, Sourav Dutta, Juho Lauri, Srinivasan Parthasarathy, Alessandra Sala:
Towards Quantifying the Distance between Opinions. ICWSM 2020: 229-239 - [c37]James Fitzpatrick, Paula Carroll, Deepak Ajwani:
Creating and Characterising Electricity Load Profiles of Residential Buildings. AALTD@PKDD/ECML 2020: 182-203 - [i11]Juho Lauri, Sourav Dutta, Marco Grassia, Deepak Ajwani:
Learning fine-grained search space pruning and heuristics for combinatorial optimization. CoRR abs/2001.01230 (2020) - [i10]Saket Gurukar, Deepak Ajwani, Sourav Dutta, Juho Lauri, Srinivasan Parthasarathy, Alessandra Sala:
Towards Quantifying the Distance between Opinions. CoRR abs/2001.09879 (2020)
2010 – 2019
- 2019
- [j9]Guruprasad Nayak, Sourav Dutta, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala:
Automated assessment of knowledge hierarchy evolution: comparing directed acyclic graphs. Inf. Retr. J. 22(3-4): 256-284 (2019) - [c36]Erika Duriakova, Deepak Ajwani, Neil Hurley:
Engineering a Parallel Δ-stepping Algorithm. IEEE BigData 2019: 609-616 - [i9]Marco Grassia, Juho Lauri, Sourav Dutta, Deepak Ajwani:
Learning Multi-Stage Sparsification for Maximum Clique Enumeration. CoRR abs/1910.00517 (2019) - [i8]Nikolaos Tziavelis, Deepak Ajwani, Wolfgang Gatterbauer, Mirek Riedewald, Xiaofeng Yang:
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. CoRR abs/1911.05582 (2019) - 2018
- [j8]Jiongqian Liang, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala, Srinivasan Parthasarathy:
Prioritized Relationship Analysis in Heterogeneous Information Networks. ACM Trans. Knowl. Discov. Data 12(3): 29:1-29:27 (2018) - [c35]Deepak Ajwani, Bilyana Taneva, Sourav Dutta, Patrick K. Nicholson, Ghasem Heyrani-Nobari, Alessandra Sala:
ANNOTATE: orgANizing uNstructured cOntenTs viA Topic labEls. IEEE BigData 2018: 1699-1708 - [c34]Alexander Schickedanz, Deepak Ajwani, Ulrich Meyer, Pawel Gawrychowski:
Average-Case Behavior of k-Shortest Path Algorithms. COMPLEX NETWORKS (1) 2018: 28-40 - [c33]Deepak Ajwani, Sourav Dutta, Patrick K. Nicholson, Luca Maria Aiello, Alessandra Sala:
Efficient Auto-Generation of Taxonomies for Structured Knowledge Discovery and Organization. HT 2018: 251-252 - [c32]Deepak Ajwani, Erika Duriakova, Neil Hurley, Ulrich Meyer, Alexander Schickedanz:
An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores. ICPP 2018: 78:1-78:12 - [c31]Guruprasad Nayak, Sourav Dutta, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala:
Automated Knowledge Hierarchy Assessment. ProfS/KG4IR/Data:Search@SIGIR 2018: 59-60 - [c30]Nikhita Vedula, Patrick K. Nicholson, Deepak Ajwani, Sourav Dutta, Alessandra Sala, Srinivasan Parthasarathy:
Enriching Taxonomies With Functional Domain Knowledge. SIGIR 2018: 745-754 - [c29]Xiaofeng Yang, Deepak Ajwani, Wolfgang Gatterbauer, Patrick K. Nicholson, Mirek Riedewald, Alessandra Sala:
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs. WWW 2018: 489-498 - [i7]Xiaofeng Yang, Deepak Ajwani, Wolfgang Gatterbauer, Patrick K. Nicholson, Mirek Riedewald, Alessandra Sala:
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs. CoRR abs/1802.06060 (2018) - 2017
- [c28]Tiep Mai, Bichen Shi, Patrick K. Nicholson, Deepak Ajwani, Alessandra Sala:
Scalable Disambiguation System Capturing Individualities of Mentions. LDK 2017: 365-379 - [c27]Jiankai Sun, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala, Srinivasan Parthasarathy:
Breaking Cycles In Noisy Hierarchies. WebSci 2017: 151-160 - 2016
- [j7]Deepak Ajwani, Adam Hackett, Shoukat Ali, John P. Morrison, Stephen Kirkland:
Co-optimizing application partitioning and network topology for a reconfigurable interconnect. J. Parallel Distributed Comput. 96: 12-26 (2016) - [c26]Jiongqian Liang, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala, Srinivasan Parthasarathy:
What Links Alice and Bob?: Matching and Ranking Semantic Patterns in Heterogeneous Networks. WWW 2016: 879-889 - [i6]Tiep Mai, Bichen Shi, Patrick K. Nicholson, Deepak Ajwani, Alessandra Sala:
Distributed Entity Disambiguation with Per-Mention Learning. CoRR abs/1604.05875 (2016) - 2015
- [c25]Deepak Ajwani, Ulrich Meyer, David Veith:
An I/O-efficient Distance Oracle for Evolving Real-World Graphs. ALENEX 2015: 159-172 - [c24]Tiep Mai, Deepak Ajwani, Alessandra Sala:
Profiling User Activities with Minimal Traffic Traces. ICWE 2015: 116-133 - [c23]Deepak Ajwani, Marcel Karnstedt, Alessandra Sala:
Processing Large Graphs: Representations, Storage, Systems and Algorithms. WWW (Companion Volume) 2015: 1545 - [i5]Tiep Mai, Deepak Ajwani, Alessandra Sala:
Profiling user activities with minimal traffic traces. CoRR abs/1504.01781 (2015) - 2014
- [c22]Erika Duriakova, Neil Hurley, Deepak Ajwani, Alessandra Sala:
Analysis of the semi-synchronous approach to large-scale parallel community finding. COSN 2014: 51-62 - [i4]Deepak Ajwani, W. Sean Kennedy, Alessandra Sala, Iraj Saniee:
A Geometric Distance Oracle for Large Real-World Graphs. CoRR abs/1404.5002 (2014) - 2013
- [j6]Deepak Ajwani, Shoukat Ali, Kostas Katrinis, Cheng-Hong Li, Alfred J. Park, John P. Morrison, Eugen Schenfeld:
Generating synthetic task graphs for simulating stream computing systems. J. Parallel Distributed Comput. 73(10): 1362-1374 (2013) - [c21]Deepak Ajwani, Nodari Sitchinava:
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures. ESA 2013: 25-36 - [c20]Adam Hackett, Deepak Ajwani, Shoukat Ali, Steve Kirkland, John P. Morrison:
Seeds for a Heterogeneous Interconnect. IPDPS Workshops 2013: 84-92 - [c19]Adam Hackett, Deepak Ajwani, Shoukat Ali, Steve Kirkland, John P. Morrison:
A Network Configuration Algorithm Based on Optimization of Kirchhoff Index. IPDPS 2013: 407-417 - [i3]Deepak Ajwani, Nodari Sitchinava:
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures. CoRR abs/1306.4521 (2013) - 2012
- [j5]Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray:
Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors. Discret. Comput. Geom. 48(1): 39-52 (2012) - [c18]Deepak Ajwani, Andreas Beckmann, Ulrich Meyer, David Veith:
I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. ARCS Workshops 2012: 493-504 - [c17]Deepak Ajwani, Ulrich Meyer, David Veith:
I/O-efficient Hierarchical Diameter Approximation. ESA 2012: 72-83 - [c16]Deepak Ajwani, Shoukat Ali, John P. Morrison:
Graph Partitioning for Reconfigurable Topology. IPDPS 2012: 836-847 - 2011
- [j4]Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh:
A topological sorting algorithm for large graphs. ACM J. Exp. Algorithmics 17(1) (2011) - [c15]Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh:
Engineering a Topological Sorting Algorithm for Massive Graphs. ALENEX 2011: 139-150 - [c14]Deepak Ajwani, Nodari Sitchinava, Norbert Zeh:
I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors. IPDPS 2011: 1114-1123 - [c13]Deepak Ajwani, Shoukat Ali, Kostas Katrinis, Cheng-Hong Li, Alfred J. Park, John P. Morrison, Eugen Schenfeld:
A Flexible Workload Generator for Simulating Stream Computing Systems. MASCOTS 2011: 409-417 - 2010
- [j3]Deepak Ajwani, Tobias Friedrich:
Average-case analysis of incremental topological ordering. Discret. Appl. Math. 158(4): 240-250 (2010) - [c12]Deepak Ajwani, Henning Meyerhenke:
Realistic Computer Models. Algorithm Engineering 2010: 194-236 - [c11]Deepak Ajwani, Nodari Sitchinava, Norbert Zeh:
Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). ESA (2) 2010: 75-86
2000 – 2009
- 2009
- [c10]Deepak Ajwani, Ulrich Meyer:
Design and Engineering of External Memory Traversal Algorithms for General Graphs. Algorithmics of Large and Complex Networks 2009: 1-33 - [c9]Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz:
On Computational Models for Flash Memory Devices. SEA 2009: 16-27 - 2008
- [b1]Deepak Ajwani:
Traversing large graphs in realistic settings. Saarland University, 2008 - [j2]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for incremental topological ordering. ACM Trans. Algorithms 4(4): 39:1-39:14 (2008) - [c8]Deepak Ajwani, Itay Malinger, Ulrich Meyer, Sivan Toledo:
Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. WEA 2008: 208-219 - [i2]Deepak Ajwani, Tobias Friedrich:
Average-Case Analysis of Online Topological Ordering. CoRR abs/0802.1059 (2008) - 2007
- [c7]Deepak Ajwani, Ulrich Meyer, Vitaly Osipov:
Improved External Memory BFS Implementation. ALENEX 2007 - [c6]Deepak Ajwani, Tobias Friedrich:
Average-Case Analysis of Online Topological Ordering. ISAAC 2007: 464-475 - [c5]Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray:
Conflict-free coloring for rectangle ranges using O(n.382) colors. SPAA 2007: 181-187 - [c4]Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary:
On Computing the Centroid of the Vertices of an Arrangement and Related Problems. WADS 2007: 519-528 - 2006
- [j1]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering. Electron. Notes Discret. Math. 25: 7-12 (2006) - [c3]Deepak Ajwani, Ulrich Meyer, Vitaly Osipov:
Breadth First Search on Massive Graphs. The Shortest Path Problem 2006: 291-307 - [c2]Deepak Ajwani, Roman Dementiev, Ulrich Meyer:
A computational study of external-memory BFS algorithms. SODA 2006: 601-610 - [c1]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) Algorithm for Online Topological Ordering. SWAT 2006: 53-64 - [i1]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering. CoRR abs/cs/0602073 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
