default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhishek Awasthi
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Maximilian Hess, Lilly Palackal, Abhishek Awasthi, Karen Wintersperger:
Effective Embedding of Integer Linear Inequalities for Variational Quantum Algorithms. QCE 2024: 221-231- [c10]Abhishek Awasthi, Nico Kraus, Florian Krellner, David Zambrano:
Real World Application of Quantum-Classical Optimization for Production Scheduling. QCE 2024: 239-244 - 2023
- [i4]Dominik Leib, Tobias Seidel, Sven Jäger, Raoul Heese, Caitlin Isobel Jones, Abhishek Awasthi, Astrid Elisa Niederle, Michael Bortz:
A Quantum Optimization Case Study for a Transport Robot Scheduling Problem. CoRR abs/2309.09736 (2023)
2010 – 2019
- 2018
- [c9]Markus Ullrich, Thomas Weise, Abhishek Awasthi, Jörg Lässig:
A generic problem instance generator for discrete optimization problems. GECCO (Companion) 2018: 1761-1768 - [c8]Abhishek Awasthi, Snehal Bagawade, Amit Kumar, Praveen K. Jain:
An Exact Time Domain Analysis of DCM Boost Mode LLC Resonant Converter for PV applications. IECON 2018: 1005-1010 - 2017
- [j1]Karthikeyan Venkitusamy, Sanjeevikumar Padmanaban
, Michael G. Pecht, Abhishek Awasthi, Rajasekar Selvamuthukumaran:
A modified boost rectifier for elimination of circulating current in power factor correction applications. Microelectron. Reliab. 69: 29-35 (2017) - 2016
- [c7]Abhishek Awasthi, Jörg Lässig, Thomas Weise, Oliver Kramer:
Tackling Common Due Window Problem with a Two-Layered Approach. COCOA 2016: 772-781 - [c6]Abhishek Awasthi, Jörg Lässig, Jens Leuschner, Thomas Weise:
GPGPU-Based Parallel Algorithms for Scheduling Against Due Date. IPDPS Workshops 2016: 766-775 - 2015
- [c5]Abhishek Awasthi, Jörg Lässig, Oliver Kramer:
Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence. ICEIS (1) 2015: 526-534 - 2014
- [c4]Abhishek Awasthi, Jörg Lässig, Oliver Kramer, Thomas Weise:
Common Due-Window problem: Polynomial algorithms for a given processing sequence. CIPLS 2014: 32-39 - [c3]Jörg Lässig, Abhishek Awasthi, Oliver Kramer:
Common Due-Date Problem: Linear Algorithm for a Given Job Sequence. CSE 2014: 97-104 - [i3]Abhishek Awasthi, Jörg Lässig, Oliver Kramer:
A Novel Approach to the Common Due-Date Problem on Single and Parallel Machines. CoRR abs/1405.1234 (2014) - 2013
- [c2]Abhishek Awasthi, Oliver Kramer, Jörg Lässig:
Aircraft Landing Problem: An Efficient Algorithm for a Given Landing Sequence. CSE 2013: 20-27 - [c1]Abhishek Awasthi, Jörg Lässig, Oliver Kramer:
Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence. SYNASC 2013: 258-264 - [i2]Abhishek Awasthi, Jörg Lässig, Oliver Kramer:
Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence. CoRR abs/1311.2879 (2013) - [i1]Abhishek Awasthi, Oliver Kramer, Jörg Lässig:
Aircraft Landing Problem: Efficient Algorithm for a Given Landing Sequence. CoRR abs/1311.2880 (2013)
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 2025-01-26 23:50 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:
