default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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
no matches
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 236 matches
- 2024
- Ernst Althaus
, Daniela Schnurbusch:
Reducing Treewidth for SAT-Related Problems Using Simple Liftings. ISCO 2024: 175-191 - Rafael Castro de Andrade:
Crystal Trees. ISCO 2024: 163-172 - Antonios Antoniadis, Hajo Broersma, Yang Meng:
Online Graph Coloring with Predictions. ISCO 2024: 289-302 - Ishan Bansal, Ryan Mao, Avhan Misra:
Network Design on Undirected Series-Parallel Graphs. ISCO 2024: 277-288 - Marie Baratto, Yves Crama:
Optimal Cycle Selections: An Experimental Assessment of Integer Programming Formulations. ISCO 2024: 56-70 - Fatiha Bendali, Alejandro Olivas Gonzales, Alain Quilliot, Hélène Toussaint:
Surrogate Constraints for Synchronized Energy Production/Consumption. ISCO 2024: 335-347 - Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot:
Approximation Algorithm for Job Scheduling with Reconfigurable Resources. ISCO 2024: 263-276 - Andrew Bloch-Hansen, Roberto Solis-Oba:
The Thief Orienteering Problem on Series-Parallel Graphs. ISCO 2024: 248-262 - Dipayan Chakraborty, Annegret Katrin Wagler:
Open-Separating Dominating Codes in Graphs. ISCO 2024: 137-151 - Claudio Contardo, Ricardo Fukasawa, Louis-Martin Rousseau, Thibaut Vidal:
Optimal Counterfactual Explanations for k-Nearest Neighbors Using Mathematical Optimization and Constraint Programming. ISCO 2024: 318-331 - Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker:
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. ISCO 2024: 16-29 - Sophie Demassey, Valentina Sessa, Amirhossein Tavakoli:
Alternating Direction Method and Deep Learning for Discrete Control with Storage. ISCO 2024: 85-96 - Diego Delle Donne, Mariana S. Escalante, Pablo G. Fekete, Lucía Moroni:
1-Persistency of the Clique Relaxation of the Stable Set Polytope. ISCO 2024: 71-84 - Diego Delle Donne, Mariana S. Escalante, María Elisa Ugarte:
On the Complexity of the Minimum Chromatic Violation Problem. ISCO 2024: 152-162 - Leon Eifler, Jakob Witzig, Ambros M. Gleixner:
Branch and Cut for Partitioning a Graph into a Cycle of Clusters. ISCO 2024: 97-108 - Alberto José Ferrari, Valeria A. Leoni, Graciela L. Nasini, Gabriel Valiente:
Minimizing External Vertices in Hypergraph Orientations. ISCO 2024: 125-136 - Luca Ferrarini, Samuel Fiorini, Stefan Kober, Yelena Yuditsky:
Total Matching and Subdeterminants. ISCO 2024: 192-204 - Akshay Gupte, Melanie Siebenhofer, Angelika Wiegele:
Computing the Edge Expansion of a Graph Using Semidefinite Programming. ISCO 2024: 111-124 - Natalia Jorquera-Bravo, Sourour Elloumi, Safia Kedad-Sidhoum, Agnès Plateau:
Fair Energy Allocation for Collective Self-consumption. ISCO 2024: 388-401 - Dymitr Lubczyk, José Neto:
Neuron Pairs in Binarized Neural Networks Robustness Verification via Integer Linear Programming. ISCO 2024: 305-317 - Sven Mallach:
A Family of Spanning-Tree Formulations for the Maximum Cut Problem. ISCO 2024: 43-55 - Maher Mallem, Claire Hanen, Alix Munier Kordon:
A New Structural Parameter on Single Machine Scheduling with Release Dates and Deadlines. ISCO 2024: 205-219 - Dilson Lucas Pereira, Dilson Almeida Guimarães, Alexandre Salles da Cunha, Abilio Lucena:
Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem. ISCO 2024: 30-42 - Luca Pirolo, Pietro Belotti, Federico Malucelli, Rossella Moscarelli, Paolo Pileri:
Optimal Charging Station Location in a Linear Cycle Path with Deviations. ISCO 2024: 361-375 - Tom Portoleau, Claudia D'Ambrosio:
A Robust Two-Stage Model for the Urban Air Mobility Flight Scheduling Problem. ISCO 2024: 348-360 - Yushan Qu, Jon Lee:
On Disjunction Convex Hulls by Lifting. ISCO 2024: 3-15 - Puck te Rietmole, Marc Uetz:
Sequencing Stochastic Jobs with a Single Sample. ISCO 2024: 235-247 - Giovanni Righini, Marco Trubian:
An Efficient Timing Algorithm for Drivers with Rest Periods. ISCO 2024: 376-387 - Victor Spitzer, Céline Gicquel, Evgeny Gurevsky, François Sanson:
Day-Ahead Lot-Sizing Under Uncertainty: An Application to Green Hydrogen Production. ISCO 2024: 402-416 - Suguru Yamada, Tesshu Hanaka:
Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs. ISCO 2024: 220-232
skipping 206 more matches
loading more results 
failed to load more results, please try again later
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 2025-01-16 04:22 CET 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:
