Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "Deepak Ajwani"
download as .bib file
@inproceedings{DBLP:conf/inoc/0013TRA24,
author = {Jiwei Zhang and
Dena Tayebi and
Saurabh Ray and
Deepak Ajwani},
title = {Learning to Prune Instances of Steiner Tree Problem in Graphs},
booktitle = {{INOC}},
pages = {40--45},
year = {2024},
url = {https://doi.org/10.48786/inoc.2024.08},
doi = {10.48786/INOC.2024.08},
timestamp = {Tue, 16 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/inoc/0013TRA24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/inoc/CarrollA24,
author = {Paula Carroll and
Deepak Ajwani},
title = {Foreword},
booktitle = {{INOC}},
pages = {1--3},
year = {2024},
url = {https://doi.org/10.48786/inoc.2024.01},
doi = {10.48786/INOC.2024.01},
timestamp = {Tue, 16 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/inoc/CarrollA24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/inoc/2024,
editor = {Paula Carroll and
Deepak Ajwani},
title = {Proceedings of the 11th International Network Optimization Conference,
{INOC} 2024, Dublin, Ireland, March 11-23, 2024},
publisher = {OpenProceedings.org},
year = {2024},
isbn = {978-3-89318-096-7},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/inoc/2024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-05143,
author = {Rohan Deepak Ajwani and
Zining Zhu and
Jonathan Rose and
Frank Rudzicz},
title = {Plug and Play with Prompts: {A} Prompt Tuning Approach for Controlling
Text Generation},
journal = {CoRR},
volume = {abs/2404.05143},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.05143},
doi = {10.48550/ARXIV.2404.05143},
eprinttype = {arXiv},
eprint = {2404.05143},
timestamp = {Wed, 15 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-05143.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2405-06800,
author = {Rohan Deepak Ajwani and
Shashidhar Reddy Javaji and
Frank Rudzicz and
Zining Zhu},
title = {LLM-Generated Black-box Explanations Can Be Adversarially Helpful},
journal = {CoRR},
volume = {abs/2405.06800},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2405.06800},
doi = {10.48550/ARXIV.2405.06800},
eprinttype = {arXiv},
eprint = {2405.06800},
timestamp = {Sat, 15 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2405-06800.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/Lauri0GA23,
author = {Juho Lauri and
Sourav Dutta and
Marco Grassia and
Deepak Ajwani},
title = {Learning fine-grained search space pruning and heuristics for combinatorial
optimization},
journal = {J. Heuristics},
volume = {29},
number = {2-3},
pages = {313--347},
year = {2023},
url = {https://doi.org/10.1007/s10732-023-09512-z},
doi = {10.1007/S10732-023-09512-Z},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/heuristics/Lauri0GA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lion/FitzpatrickAC23,
author = {James Fitzpatrick and
Deepak Ajwani and
Paula Carroll},
title = {Learning to Prune Electric Vehicle Routing Problems},
booktitle = {{LION}},
pages = {378--392},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-44505-7\_26},
doi = {10.1007/978-3-031-44505-7\_26},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lion/FitzpatrickAC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-11812,
author = {Deepak Ajwani and
Rob H. Bisseling and
Katrin Casel and
{\"{U}}mit V. {\c{C}}ataly{\"{u}}rek and
C{\'{e}}dric Chevalier and
Florian Chudigiewitsch and
Marcelo Fonseca Faraj and
Michael R. Fellows and
Lars Gottesb{\"{u}}ren and
Tobias Heuer and
George Karypis and
Kamer Kaya and
Jakub Lacki and
Johannes Langguth and
Xiaoye Sherry Li and
Ruben Mayer and
Johannes Meintrup and
Yosuke Mizutani and
Fran{\c{c}}ois Pellegrini and
Fabrizio Petrini and
Frances A. Rosamond and
Ilya Safro and
Sebastian Schlag and
Christian Schulz and
Roohani Sharma and
Darren Strash and
Blair D. Sullivan and
Bora U{\c{c}}ar and
Albert{-}Jan Yzelman},
title = {Open Problems in (Hyper)Graph Decomposition},
journal = {CoRR},
volume = {abs/2310.11812},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.11812},
doi = {10.48550/ARXIV.2310.11812},
eprinttype = {arXiv},
eprint = {2310.11812},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-11812.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/Karypis0SABCCCC23,
author = {George Karypis and
Christian Schulz and
Darren Strash and
Deepak Ajwani and
Rob H. Bisseling and
Katrin Casel and
{\"{U}}mit V. {\c{C}}ataly{\"{u}}rek and
C{\'{e}}dric Chevalier and
Florian Chudigiewitsch and
Marcelo Fonseca Faraj and
Michael R. Fellows and
Lars Gottesb{\"{u}}ren and
Tobias Heuer and
Kamer Kaya and
Jakub Lacki and
Johannes Langguth and
Xiaoye Sherry Li and
Ruben Mayer and
Johannes Meintrup and
Yosuke Mizutani and
Fran{\c{c}}ois Pellegrini and
Fabrizio Petrini and
Frances A. Rosamond and
Ilya Safro and
Sebastian Schlag and
Roohani Sharma and
Blair D. Sullivan and
Bora U{\c{c}}ar and
Albert{-}Jan Yzelman},
title = {Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331)},
journal = {Dagstuhl Reports},
volume = {13},
number = {8},
pages = {1--45},
year = {2023},
url = {https://doi.org/10.4230/DagRep.13.8.1},
doi = {10.4230/DAGREP.13.8.1},
timestamp = {Thu, 14 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/Karypis0SABCCCC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/TayebiRA22,
author = {Dena Tayebi and
Saurabh Ray and
Deepak Ajwani},
title = {Learning to Prune Instances of \emph{k}-median and Related Problems},
booktitle = {{ALENEX}},
pages = {184--194},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977042.15},
doi = {10.1137/1.9781611977042.15},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/TayebiRA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-11985,
author = {Jiwei Zhang and
Deepak Ajwani},
title = {Learning to Prune Instances of Steiner Tree Problem in Graphs},
journal = {CoRR},
volume = {abs/2208.11985},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.11985},
doi = {10.48550/ARXIV.2208.11985},
eprinttype = {arXiv},
eprint = {2208.11985},
timestamp = {Thu, 29 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-11985.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/FitzpatrickAC21,
author = {James Fitzpatrick and
Deepak Ajwani and
Paula Carroll},
title = {Learning to Sparsify Travelling Salesman Problem Instances},
booktitle = {{CPAIOR}},
pages = {410--426},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-78230-6\_26},
doi = {10.1007/978-3-030-78230-6\_26},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/FitzpatrickAC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-09345,
author = {James Fitzpatrick and
Deepak Ajwani and
Paula Carroll},
title = {Learning to Sparsify Travelling Salesman Problem Instances},
journal = {CoRR},
volume = {abs/2104.09345},
year = {2021},
url = {https://arxiv.org/abs/2104.09345},
eprinttype = {arXiv},
eprint = {2104.09345},
timestamp = {Mon, 26 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-09345.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-03111,
author = {Rohan Deepak Ajwani and
Arshika Lalan and
Basabdatta Sen Bhattacharya and
Joy Bose},
title = {Sparse Distributed Memory using Spiking Neural Networks on Nengo},
journal = {CoRR},
volume = {abs/2109.03111},
year = {2021},
url = {https://arxiv.org/abs/2109.03111},
eprinttype = {arXiv},
eprint = {2109.03111},
timestamp = {Mon, 20 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-03111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/TziavelisAGRY20,
author = {Nikolaos Tziavelis and
Deepak Ajwani and
Wolfgang Gatterbauer and
Mirek Riedewald and
Xiaofeng Yang},
title = {Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive
Queries},
journal = {Proc. {VLDB} Endow.},
volume = {13},
number = {9},
pages = {1582--1597},
year = {2020},
url = {http://www.vldb.org/pvldb/vol13/p1582-tziavelis.pdf},
doi = {10.14778/3397230.3397250},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pvldb/TziavelisAGRY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icwsm/GurukarA0L0S20,
author = {Saket Gurukar and
Deepak Ajwani and
Sourav Dutta and
Juho Lauri and
Srinivasan Parthasarathy and
Alessandra Sala},
title = {Towards Quantifying the Distance between Opinions},
booktitle = {{ICWSM}},
pages = {229--239},
year = {2020},
url = {https://ojs.aaai.org/index.php/ICWSM/article/view/7294},
timestamp = {Mon, 07 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icwsm/GurukarA0L0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pkdd/FitzpatrickCA20,
author = {James Fitzpatrick and
Paula Carroll and
Deepak Ajwani},
title = {Creating and Characterising Electricity Load Profiles of Residential
Buildings},
booktitle = {AALTD@PKDD/ECML},
pages = {182--203},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-65742-0\_13},
doi = {10.1007/978-3-030-65742-0\_13},
timestamp = {Sat, 09 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pkdd/FitzpatrickCA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-01230,
author = {Juho Lauri and
Sourav Dutta and
Marco Grassia and
Deepak Ajwani},
title = {Learning fine-grained search space pruning and heuristics for combinatorial
optimization},
journal = {CoRR},
volume = {abs/2001.01230},
year = {2020},
url = {http://arxiv.org/abs/2001.01230},
eprinttype = {arXiv},
eprint = {2001.01230},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-01230.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-09879,
author = {Saket Gurukar and
Deepak Ajwani and
Sourav Dutta and
Juho Lauri and
Srinivasan Parthasarathy and
Alessandra Sala},
title = {Towards Quantifying the Distance between Opinions},
journal = {CoRR},
volume = {abs/2001.09879},
year = {2020},
url = {https://arxiv.org/abs/2001.09879},
eprinttype = {arXiv},
eprint = {2001.09879},
timestamp = {Thu, 30 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-09879.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ir/NayakDANS19,
author = {Guruprasad Nayak and
Sourav Dutta and
Deepak Ajwani and
Patrick K. Nicholson and
Alessandra Sala},
title = {Automated assessment of knowledge hierarchy evolution: comparing directed
acyclic graphs},
journal = {Inf. Retr. J.},
volume = {22},
number = {3-4},
pages = {256--284},
year = {2019},
url = {https://doi.org/10.1007/s10791-018-9345-y},
doi = {10.1007/S10791-018-9345-Y},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ir/NayakDANS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/DuriakovaAH19,
author = {Erika Duriakova and
Deepak Ajwani and
Neil Hurley},
title = {Engineering a Parallel {\(\Delta\)}-stepping Algorithm},
booktitle = {{IEEE} BigData},
pages = {609--616},
year = {2019},
url = {https://doi.org/10.1109/BigData47090.2019.9006237},
doi = {10.1109/BIGDATA47090.2019.9006237},
timestamp = {Wed, 31 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bigdataconf/DuriakovaAH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00517,
author = {Marco Grassia and
Juho Lauri and
Sourav Dutta and
Deepak Ajwani},
title = {Learning Multi-Stage Sparsification for Maximum Clique Enumeration},
journal = {CoRR},
volume = {abs/1910.00517},
year = {2019},
url = {http://arxiv.org/abs/1910.00517},
eprinttype = {arXiv},
eprint = {1910.00517},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-00517.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-05582,
author = {Nikolaos Tziavelis and
Deepak Ajwani and
Wolfgang Gatterbauer and
Mirek Riedewald and
Xiaofeng Yang},
title = {Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive
Queries},
journal = {CoRR},
volume = {abs/1911.05582},
year = {2019},
url = {http://arxiv.org/abs/1911.05582},
eprinttype = {arXiv},
eprint = {1911.05582},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-05582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkdd/LiangANSP18,
author = {Jiongqian Liang and
Deepak Ajwani and
Patrick K. Nicholson and
Alessandra Sala and
Srinivasan Parthasarathy},
title = {Prioritized Relationship Analysis in Heterogeneous Information Networks},
journal = {{ACM} Trans. Knowl. Discov. Data},
volume = {12},
number = {3},
pages = {29:1--29:27},
year = {2018},
url = {https://doi.org/10.1145/3154401},
doi = {10.1145/3154401},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkdd/LiangANSP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/AjwaniTDNHS18,
author = {Deepak Ajwani and
Bilyana Taneva and
Sourav Dutta and
Patrick K. Nicholson and
Ghasem Heyrani{-}Nobari and
Alessandra Sala},
title = {{ANNOTATE:} orgANizing uNstructured cOntenTs viA Topic labEls},
booktitle = {{IEEE} BigData},
pages = {1699--1708},
year = {2018},
url = {https://doi.org/10.1109/BigData.2018.8622647},
doi = {10.1109/BIGDATA.2018.8622647},
timestamp = {Wed, 31 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bigdataconf/AjwaniTDNHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/complexnetworks/SchickedanzA0G18,
author = {Alexander Schickedanz and
Deepak Ajwani and
Ulrich Meyer and
Pawel Gawrychowski},
title = {Average-Case Behavior of k-Shortest Path Algorithms},
booktitle = {{COMPLEX} {NETWORKS} {(1)}},
pages = {28--40},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-05411-3\_3},
doi = {10.1007/978-3-030-05411-3\_3},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/complexnetworks/SchickedanzA0G18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ht/AjwaniDNAS18,
author = {Deepak Ajwani and
Sourav Dutta and
Patrick K. Nicholson and
Luca Maria Aiello and
Alessandra Sala},
title = {Efficient Auto-Generation of Taxonomies for Structured Knowledge Discovery
and Organization},
booktitle = {{HT}},
pages = {251--252},
year = {2018},
url = {https://doi.org/10.1145/3209542.3212476},
doi = {10.1145/3209542.3212476},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ht/AjwaniDNAS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/AjwaniDH0S18,
author = {Deepak Ajwani and
Erika Duriakova and
Neil Hurley and
Ulrich Meyer and
Alexander Schickedanz},
title = {An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores},
booktitle = {{ICPP}},
pages = {78:1--78:12},
year = {2018},
url = {https://doi.org/10.1145/3225058.3225075},
doi = {10.1145/3225058.3225075},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icpp/AjwaniDH0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/NayakDANS18,
author = {Guruprasad Nayak and
Sourav Dutta and
Deepak Ajwani and
Patrick K. Nicholson and
Alessandra Sala},
title = {Automated Knowledge Hierarchy Assessment},
booktitle = {ProfS/KG4IR/Data:Search@SIGIR},
pages = {59--60},
year = {2018},
url = {https://ceur-ws.org/Vol-2127/paper4-kg4ir.pdf},
timestamp = {Fri, 10 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sigir/NayakDANS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/VedulaNADS018,
author = {Nikhita Vedula and
Patrick K. Nicholson and
Deepak Ajwani and
Sourav Dutta and
Alessandra Sala and
Srinivasan Parthasarathy},
title = {Enriching Taxonomies With Functional Domain Knowledge},
booktitle = {{SIGIR}},
pages = {745--754},
year = {2018},
url = {https://doi.org/10.1145/3209978.3210000},
doi = {10.1145/3209978.3210000},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigir/VedulaNADS018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/YangAGNRS18,
author = {Xiaofeng Yang and
Deepak Ajwani and
Wolfgang Gatterbauer and
Patrick K. Nicholson and
Mirek Riedewald and
Alessandra Sala},
title = {Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs},
booktitle = {{WWW}},
pages = {489--498},
year = {2018},
url = {https://doi.org/10.1145/3178876.3186115},
doi = {10.1145/3178876.3186115},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/YangAGNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-06060,
author = {Xiaofeng Yang and
Deepak Ajwani and
Wolfgang Gatterbauer and
Patrick K. Nicholson and
Mirek Riedewald and
Alessandra Sala},
title = {Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs},
journal = {CoRR},
volume = {abs/1802.06060},
year = {2018},
url = {http://arxiv.org/abs/1802.06060},
eprinttype = {arXiv},
eprint = {1802.06060},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-06060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ldk/MaiSNAS17,
author = {Tiep Mai and
Bichen Shi and
Patrick K. Nicholson and
Deepak Ajwani and
Alessandra Sala},
title = {Scalable Disambiguation System Capturing Individualities of Mentions},
booktitle = {{LDK}},
pages = {365--379},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59888-8\_31},
doi = {10.1007/978-3-319-59888-8\_31},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ldk/MaiSNAS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/websci/SunANSP17,
author = {Jiankai Sun and
Deepak Ajwani and
Patrick K. Nicholson and
Alessandra Sala and
Srinivasan Parthasarathy},
title = {Breaking Cycles In Noisy Hierarchies},
booktitle = {WebSci},
pages = {151--160},
year = {2017},
url = {https://doi.org/10.1145/3091478.3091495},
doi = {10.1145/3091478.3091495},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/websci/SunANSP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/AjwaniHAMK16,
author = {Deepak Ajwani and
Adam Hackett and
Shoukat Ali and
John P. Morrison and
Stephen Kirkland},
title = {Co-optimizing application partitioning and network topology for a
reconfigurable interconnect},
journal = {J. Parallel Distributed Comput.},
volume = {96},
pages = {12--26},
year = {2016},
url = {https://doi.org/10.1016/j.jpdc.2016.04.010},
doi = {10.1016/J.JPDC.2016.04.010},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/AjwaniHAMK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/LiangANSP16,
author = {Jiongqian Liang and
Deepak Ajwani and
Patrick K. Nicholson and
Alessandra Sala and
Srinivasan Parthasarathy},
title = {What Links Alice and Bob?: Matching and Ranking Semantic Patterns
in Heterogeneous Networks},
booktitle = {{WWW}},
pages = {879--889},
year = {2016},
url = {https://doi.org/10.1145/2872427.2883007},
doi = {10.1145/2872427.2883007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/LiangANSP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MaiSNAS16,
author = {Tiep Mai and
Bichen Shi and
Patrick K. Nicholson and
Deepak Ajwani and
Alessandra Sala},
title = {Distributed Entity Disambiguation with Per-Mention Learning},
journal = {CoRR},
volume = {abs/1604.05875},
year = {2016},
url = {http://arxiv.org/abs/1604.05875},
eprinttype = {arXiv},
eprint = {1604.05875},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MaiSNAS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/AjwaniMV15,
author = {Deepak Ajwani and
Ulrich Meyer and
David Veith},
title = {An I/O-efficient Distance Oracle for Evolving Real-World Graphs},
booktitle = {{ALENEX}},
pages = {159--172},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973754.14},
doi = {10.1137/1.9781611973754.14},
timestamp = {Tue, 25 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/AjwaniMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icwe/MaiAS15,
author = {Tiep Mai and
Deepak Ajwani and
Alessandra Sala},
title = {Profiling User Activities with Minimal Traffic Traces},
booktitle = {{ICWE}},
pages = {116--133},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19890-3\_9},
doi = {10.1007/978-3-319-19890-3\_9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icwe/MaiAS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/AjwaniKS15,
author = {Deepak Ajwani and
Marcel Karnstedt and
Alessandra Sala},
title = {Processing Large Graphs: Representations, Storage, Systems and Algorithms},
booktitle = {{WWW} (Companion Volume)},
pages = {1545},
year = {2015},
url = {https://doi.org/10.1145/2740908.2741990},
doi = {10.1145/2740908.2741990},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/AjwaniKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MaiAS15,
author = {Tiep Mai and
Deepak Ajwani and
Alessandra Sala},
title = {Profiling user activities with minimal traffic traces},
journal = {CoRR},
volume = {abs/1504.01781},
year = {2015},
url = {http://arxiv.org/abs/1504.01781},
eprinttype = {arXiv},
eprint = {1504.01781},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MaiAS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cosn/DuriakovaHAS14,
author = {Erika Duriakova and
Neil Hurley and
Deepak Ajwani and
Alessandra Sala},
title = {Analysis of the semi-synchronous approach to large-scale parallel
community finding},
booktitle = {{COSN}},
pages = {51--62},
year = {2014},
url = {https://doi.org/10.1145/2660460.2660474},
doi = {10.1145/2660460.2660474},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cosn/DuriakovaHAS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AjwaniKSS14,
author = {Deepak Ajwani and
W. Sean Kennedy and
Alessandra Sala and
Iraj Saniee},
title = {A Geometric Distance Oracle for Large Real-World Graphs},
journal = {CoRR},
volume = {abs/1404.5002},
year = {2014},
url = {http://arxiv.org/abs/1404.5002},
eprinttype = {arXiv},
eprint = {1404.5002},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AjwaniKSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/AjwaniAKLPMS13,
author = {Deepak Ajwani and
Shoukat Ali and
Kostas Katrinis and
Cheng{-}Hong Li and
Alfred J. Park and
John P. Morrison and
Eugen Schenfeld},
title = {Generating synthetic task graphs for simulating stream computing systems},
journal = {J. Parallel Distributed Comput.},
volume = {73},
number = {10},
pages = {1362--1374},
year = {2013},
url = {https://doi.org/10.1016/j.jpdc.2013.06.002},
doi = {10.1016/J.JPDC.2013.06.002},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/AjwaniAKLPMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AjwaniS13,
author = {Deepak Ajwani and
Nodari Sitchinava},
title = {Empirical Evaluation of the Parallel Distribution Sweeping Framework
on Multicore Architectures},
booktitle = {{ESA}},
pages = {25--36},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_3},
doi = {10.1007/978-3-642-40450-4\_3},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AjwaniS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/HackettAAKM13,
author = {Adam Hackett and
Deepak Ajwani and
Shoukat Ali and
Steve Kirkland and
John P. Morrison},
title = {A Network Configuration Algorithm Based on Optimization of Kirchhoff
Index},
booktitle = {{IPDPS}},
pages = {407--417},
year = {2013},
url = {https://doi.org/10.1109/IPDPS.2013.116},
doi = {10.1109/IPDPS.2013.116},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/HackettAAKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/HackettAAKM13a,
author = {Adam Hackett and
Deepak Ajwani and
Shoukat Ali and
Steve Kirkland and
John P. Morrison},
title = {Seeds for a Heterogeneous Interconnect},
booktitle = {{IPDPS} Workshops},
pages = {84--92},
year = {2013},
url = {https://doi.org/10.1109/IPDPSW.2013.260},
doi = {10.1109/IPDPSW.2013.260},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/HackettAAKM13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AjwaniS13,
author = {Deepak Ajwani and
Nodari Sitchinava},
title = {Empirical Evaluation of the Parallel Distribution Sweeping Framework
on Multicore Architectures},
journal = {CoRR},
volume = {abs/1306.4521},
year = {2013},
url = {http://arxiv.org/abs/1306.4521},
eprinttype = {arXiv},
eprint = {1306.4521},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AjwaniS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AjwaniEGR12,
author = {Deepak Ajwani and
Khaled M. Elbassioni and
Sathish Govindarajan and
Saurabh Ray},
title = {Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors},
journal = {Discret. Comput. Geom.},
volume = {48},
number = {1},
pages = {39--52},
year = {2012},
url = {https://doi.org/10.1007/s00454-012-9425-5},
doi = {10.1007/S00454-012-9425-5},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AjwaniEGR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/arcs/AjwaniBMV11,
author = {Deepak Ajwani and
Andreas Beckmann and
Ulrich Meyer and
David Veith},
title = {I/O-efficient approximation of graph diameters by parallel cluster
growing - a first experimental study},
booktitle = {{ARCS} Workshops},
pages = {493--504},
year = {2012},
url = {https://ieeexplore.ieee.org/document/6222204/},
timestamp = {Tue, 04 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/arcs/AjwaniBMV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AjwaniMV12,
author = {Deepak Ajwani and
Ulrich Meyer and
David Veith},
title = {I/O-efficient Hierarchical Diameter Approximation},
booktitle = {{ESA}},
pages = {72--83},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_8},
doi = {10.1007/978-3-642-33090-2\_8},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AjwaniMV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/AjwaniAM12,
author = {Deepak Ajwani and
Shoukat Ali and
John P. Morrison},
title = {Graph Partitioning for Reconfigurable Topology},
booktitle = {{IPDPS}},
pages = {836--847},
year = {2012},
url = {https://doi.org/10.1109/IPDPS.2012.80},
doi = {10.1109/IPDPS.2012.80},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/AjwaniAM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AjwaniCZ11,
author = {Deepak Ajwani and
Adan Cosgaya{-}Lozano and
Norbert Zeh},
title = {A topological sorting algorithm for large graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2011},
url = {https://doi.org/10.1145/2133803.2330083},
doi = {10.1145/2133803.2330083},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AjwaniCZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/AjwaniCZ11,
author = {Deepak Ajwani and
Adan Cosgaya{-}Lozano and
Norbert Zeh},
title = {Engineering a Topological Sorting Algorithm for Massive Graphs},
booktitle = {{ALENEX}},
pages = {139--150},
year = {2011},
url = {https://doi.org/10.1137/1.9781611972917.14},
doi = {10.1137/1.9781611972917.14},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/AjwaniCZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/AjwaniSZ11,
author = {Deepak Ajwani and
Nodari Sitchinava and
Norbert Zeh},
title = {I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors},
booktitle = {{IPDPS}},
pages = {1114--1123},
year = {2011},
url = {https://doi.org/10.1109/IPDPS.2011.106},
doi = {10.1109/IPDPS.2011.106},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/AjwaniSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mascots/AjwaniAKLPMS11,
author = {Deepak Ajwani and
Shoukat Ali and
Kostas Katrinis and
Cheng{-}Hong Li and
Alfred J. Park and
John P. Morrison and
Eugen Schenfeld},
title = {A Flexible Workload Generator for Simulating Stream Computing Systems},
booktitle = {{MASCOTS}},
pages = {409--417},
year = {2011},
url = {https://doi.org/10.1109/MASCOTS.2011.54},
doi = {10.1109/MASCOTS.2011.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mascots/AjwaniAKLPMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AjwaniF10,
author = {Deepak Ajwani and
Tobias Friedrich},
title = {Average-case analysis of incremental topological ordering},
journal = {Discret. Appl. Math.},
volume = {158},
number = {4},
pages = {240--250},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.07.006},
doi = {10.1016/J.DAM.2009.07.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AjwaniF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AjwaniM10,
author = {Deepak Ajwani and
Henning Meyerhenke},
title = {Realistic Computer Models},
booktitle = {Algorithm Engineering},
pages = {194--236},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14866-8\_5},
doi = {10.1007/978-3-642-14866-8\_5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AjwaniM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AjwaniSZ10,
author = {Deepak Ajwani and
Nodari Sitchinava and
Norbert Zeh},
title = {Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended
Abstract)},
booktitle = {{ESA} {(2)}},
pages = {75--86},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15781-3\_7},
doi = {10.1007/978-3-642-15781-3\_7},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AjwaniSZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dfg/AjwaniM09,
author = {Deepak Ajwani and
Ulrich Meyer},
title = {Design and Engineering of External Memory Traversal Algorithms for
General Graphs},
booktitle = {Algorithmics of Large and Complex Networks},
pages = {1--33},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02094-0\_1},
doi = {10.1007/978-3-642-02094-0\_1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dfg/AjwaniM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/AjwaniBJMM09,
author = {Deepak Ajwani and
Andreas Beckmann and
Riko Jacob and
Ulrich Meyer and
Gabriel Moruz},
title = {On Computational Models for Flash Memory Devices},
booktitle = {{SEA}},
pages = {16--27},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02011-7\_4},
doi = {10.1007/978-3-642-02011-7\_4},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/AjwaniBJMM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Ajwani2008,
author = {Deepak Ajwani},
title = {Traversing large graphs in realistic settings},
school = {Saarland University},
year = {2008},
url = {http://scidok.sulb.uni-saarland.de/volltexte/2009/2235/},
urn = {urn:nbn:de:bsz:291-scidok-22357},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Ajwani2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AjwaniFM08,
author = {Deepak Ajwani and
Tobias Friedrich and
Ulrich Meyer},
title = {An \emph{O}(\emph{n}\({}^{\mbox{2.75}}\)) algorithm for incremental
topological ordering},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {4},
pages = {39:1--39:14},
year = {2008},
url = {https://doi.org/10.1145/1383369.1383370},
doi = {10.1145/1383369.1383370},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AjwaniFM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/AjwaniMMT08,
author = {Deepak Ajwani and
Itay Malinger and
Ulrich Meyer and
Sivan Toledo},
title = {Characterizing the Performance of Flash Memory Storage Devices and
Its Impact on Algorithm Design},
booktitle = {{WEA}},
pages = {208--219},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68552-4\_16},
doi = {10.1007/978-3-540-68552-4\_16},
timestamp = {Thu, 28 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/AjwaniMMT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-1059,
author = {Deepak Ajwani and
Tobias Friedrich},
title = {Average-Case Analysis of Online Topological Ordering},
journal = {CoRR},
volume = {abs/0802.1059},
year = {2008},
url = {http://arxiv.org/abs/0802.1059},
eprinttype = {arXiv},
eprint = {0802.1059},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-1059.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/AjwaniMO07,
author = {Deepak Ajwani and
Ulrich Meyer and
Vitaly Osipov},
title = {Improved External Memory {BFS} Implementation},
booktitle = {{ALENEX}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972870.1},
doi = {10.1137/1.9781611972870.1},
timestamp = {Tue, 25 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/AjwaniMO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AjwaniF07,
author = {Deepak Ajwani and
Tobias Friedrich},
title = {Average-Case Analysis of Online Topological Ordering},
booktitle = {{ISAAC}},
pages = {464--475},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_41},
doi = {10.1007/978-3-540-77120-3\_41},
timestamp = {Sun, 04 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AjwaniF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AjwaniEGR07,
author = {Deepak Ajwani and
Khaled M. Elbassioni and
Sathish Govindarajan and
Saurabh Ray},
title = {Conflict-free coloring for rectangle ranges using \emph{O}(\emph{n}\({}^{\mbox{.382}}\))
colors},
booktitle = {{SPAA}},
pages = {181--187},
year = {2007},
url = {https://doi.org/10.1145/1248377.1248406},
doi = {10.1145/1248377.1248406},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/AjwaniEGR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AjwaniRST07,
author = {Deepak Ajwani and
Saurabh Ray and
Raimund Seidel and
Hans Raj Tiwary},
title = {On Computing the Centroid of the Vertices of an Arrangement and Related
Problems},
booktitle = {{WADS}},
pages = {519--528},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_45},
doi = {10.1007/978-3-540-73951-7\_45},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AjwaniRST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AjwaniFM06,
author = {Deepak Ajwani and
Tobias Friedrich and
Ulrich Meyer},
title = {An O(n\({}^{\mbox{2.75}}\)) algorithm for online topological ordering},
journal = {Electron. Notes Discret. Math.},
volume = {25},
pages = {7--12},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.06.050},
doi = {10.1016/J.ENDM.2006.06.050},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AjwaniFM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/AjwaniMO06,
author = {Deepak Ajwani and
Ulrich Meyer and
Vitaly Osipov},
title = {Breadth First Search on Massive Graphs},
booktitle = {The Shortest Path Problem},
pages = {291--307},
year = {2006},
url = {https://doi.org/10.1090/dimacs/074/11},
doi = {10.1090/DIMACS/074/11},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/AjwaniMO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AjwaniDM06,
author = {Deepak Ajwani and
Roman Dementiev and
Ulrich Meyer},
title = {A computational study of external-memory {BFS} algorithms},
booktitle = {{SODA}},
pages = {601--610},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109623},
timestamp = {Tue, 25 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AjwaniDM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AjwaniFM06,
author = {Deepak Ajwani and
Tobias Friedrich and
Ulrich Meyer},
title = {An O(n\({}^{\mbox{2.75}}\)) Algorithm for Online Topological Ordering},
booktitle = {{SWAT}},
pages = {53--64},
year = {2006},
url = {https://doi.org/10.1007/11785293\_8},
doi = {10.1007/11785293\_8},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AjwaniFM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0602073,
author = {Deepak Ajwani and
Tobias Friedrich and
Ulrich Meyer},
title = {An O(n\({}^{\mbox{2.75}}\)) algorithm for online topological ordering},
journal = {CoRR},
volume = {abs/cs/0602073},
year = {2006},
url = {http://arxiv.org/abs/cs/0602073},
eprinttype = {arXiv},
eprint = {cs/0602073},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0602073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-07-08 08:24 CEST from data curated 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:
