![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 74 matches
- 2024
- Jiwei Zhang, Dena Tayebi, Saurabh Ray, Deepak Ajwani:
Learning to Prune Instances of Steiner Tree Problem in Graphs. INOC 2024: 40-45 - Paula Carroll, Deepak Ajwani:
Foreword. INOC 2024: 1-3 - 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] - Rohan Deepak Ajwani, Zining Zhu, Jonathan Rose, Frank Rudzicz:
Plug and Play with Prompts: A Prompt Tuning Approach for Controlling Text Generation. CoRR abs/2404.05143 (2024) - Rohan Deepak Ajwani, Shashidhar Reddy Javaji, Frank Rudzicz, Zining Zhu:
LLM-Generated Black-box Explanations Can Be Adversarially Helpful. CoRR abs/2405.06800 (2024) - 2023
- 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) - James Fitzpatrick
, Deepak Ajwani
, Paula Carroll
:
Learning to Prune Electric Vehicle Routing Problems. LION 2023: 378-392 - 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) - 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
- Dena Tayebi, Saurabh Ray, Deepak Ajwani:
Learning to Prune Instances of k-median and Related Problems. ALENEX 2022: 184-194 - Jiwei Zhang, Deepak Ajwani:
Learning to Prune Instances of Steiner Tree Problem in Graphs. CoRR abs/2208.11985 (2022) - 2021
- James Fitzpatrick
, Deepak Ajwani
, Paula Carroll
:
Learning to Sparsify Travelling Salesman Problem Instances. CPAIOR 2021: 410-426 - James Fitzpatrick, Deepak Ajwani, Paula Carroll:
Learning to Sparsify Travelling Salesman Problem Instances. CoRR abs/2104.09345 (2021) - Rohan Deepak Ajwani, Arshika Lalan, Basabdatta Sen Bhattacharya, Joy Bose:
Sparse Distributed Memory using Spiking Neural Networks on Nengo. CoRR abs/2109.03111 (2021) - 2020
- 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) - Saket Gurukar, Deepak Ajwani, Sourav Dutta, Juho Lauri, Srinivasan Parthasarathy, Alessandra Sala:
Towards Quantifying the Distance between Opinions. ICWSM 2020: 229-239 - James Fitzpatrick
, Paula Carroll
, Deepak Ajwani
:
Creating and Characterising Electricity Load Profiles of Residential Buildings. AALTD@PKDD/ECML 2020: 182-203 - Juho Lauri, Sourav Dutta, Marco Grassia
, Deepak Ajwani:
Learning fine-grained search space pruning and heuristics for combinatorial optimization. CoRR abs/2001.01230 (2020) - Saket Gurukar, Deepak Ajwani, Sourav Dutta, Juho Lauri, Srinivasan Parthasarathy, Alessandra Sala:
Towards Quantifying the Distance between Opinions. CoRR abs/2001.09879 (2020) - 2019
- 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) - Erika Duriakova, Deepak Ajwani, Neil Hurley:
Engineering a Parallel Δ-stepping Algorithm. IEEE BigData 2019: 609-616 - Marco Grassia
, Juho Lauri, Sourav Dutta, Deepak Ajwani:
Learning Multi-Stage Sparsification for Maximum Clique Enumeration. CoRR abs/1910.00517 (2019) - 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
- 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) - 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 - Alexander Schickedanz, Deepak Ajwani
, Ulrich Meyer, Pawel Gawrychowski
:
Average-Case Behavior of k-Shortest Path Algorithms. COMPLEX NETWORKS (1) 2018: 28-40 - 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 - 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 - Guruprasad Nayak, Sourav Dutta, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala:
Automated Knowledge Hierarchy Assessment. ProfS/KG4IR/Data:Search@SIGIR 2018: 59-60 - Nikhita Vedula, Patrick K. Nicholson
, Deepak Ajwani
, Sourav Dutta
, Alessandra Sala, Srinivasan Parthasarathy
:
Enriching Taxonomies With Functional Domain Knowledge. SIGIR 2018: 745-754
skipping 44 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-06-23 19:13 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