![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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
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 660 matches
- 2024
- Sanjeeb Dash, Yatharth Dubey
:
On polytopes with linear rank with respect to generalizations of the split closure. Discret. Optim. 51: 100821 (2024) - Dag Haugland
:
Tighter bounds on the minimum broadcast time. Discret. Optim. 51: 100822 (2024) - Nils Hausbrandt
, Oliver Bachtler, Stefan Ruzika, Luca E. Schäfer:
Parametric matroid interdiction. Discret. Optim. 51: 100823 (2024) - Dmitry Rybin
:
When greedy gives optimal: A unified approach. Discret. Optim. 51: 100824 (2024) - Lucas A. Waddell
, Warren Adams:
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique. Discret. Optim. 51: 100812 (2024) - 2023
- Bjoern Andres
, Silvia Di Gregorio
, Jannik Irmai, Jan-Hendrik Lange:
A polyhedral study of lifted multicuts. Discret. Optim. 47: 100757 (2023) - Antonios Antoniadis
, Themis Gouleakis, Pieter Kleer
, Pavel Kolev:
Secretary and online matching problems with machine learned advice. Discret. Optim. 48(Part 2): 100778 (2023) - Homa Ataei, Mansoor Davoodi
:
The p-center problem under locational uncertainty of demand points. Discret. Optim. 47: 100759 (2023) - Gábor Bacsó, Bostjan Bresar
, Kirsti Kuenzel, Douglas F. Rall:
Graphs with equal Grundy domination and independence number. Discret. Optim. 48(Part 2): 100777 (2023) - Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin:
Constructing extremal triangle-free graphs using integer programming. Discret. Optim. 50: 100802 (2023) - Daniel Berend, Shahar Golan, Yochai Twitto
:
CHAMP: A multipass algorithm for Max Sat based on saver variables. Discret. Optim. 47: 100760 (2023) - Daniel Bienstock, Gonzalo Muñoz
, Sebastian Pokutta:
Principled deep neural network training through linear programming. Discret. Optim. 49: 100795 (2023) - Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan
, Ondrej Suchý
, Tomás Valla:
Constant factor approximation for tracking paths and fault tolerant feedback vertex set. Discret. Optim. 47: 100756 (2023) - Jan Boeckmann
, Clemens Thielen, Ulrich Pferschy:
Approximating single- and multi-objective nonlinear sum and product knapsack problems. Discret. Optim. 48(Part 1): 100771 (2023) - Christoph Buchheim, Maja Hügging:
The polytope of binary sequences with bounded variation. Discret. Optim. 48(Part 1): 100776 (2023) - Robert D. Carr, Arash Haddadan, Cynthia A. Phillips:
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs. Discret. Optim. 47: 100746 (2023) - Natalia de Castro
, María Ángeles Garrido, Rafael Robles, María Trinidad Villar-Liñán:
Minimum gradation in greyscales of graphs. Discret. Optim. 48(Part 1): 100773 (2023) - Rui Chen
, Sanjeeb Dash, Oktay Günlük:
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. Discret. Optim. 50: 100804 (2023) - Chaohui Chen, Wenshui Lin
:
On the general Z-type index of connected graphs. Discret. Optim. 50: 100808 (2023) - Patrick Chervet, Roland Grappe
, Mathieu Lacroix
, Francesco Pisanu
, Roberto Wolfler Calvo
:
Hard problems on box-totally dual integral polyhedra. Discret. Optim. 50: 100810 (2023) - Leah Epstein
:
More on online weighted edge coloring. Discret. Optim. 50: 100803 (2023) - Ádám Fraknói, Dávid Á. Márton
, Dániel G. Simon
, Dániel Lenger:
On the Rényi-Ulam game with restricted size queries. Discret. Optim. 48(Part 1): 100772 (2023) - Shunhai He
, Huiqing Liu
:
The maximum number of short paths in a Halin graph. Discret. Optim. 50: 100809 (2023) - Florian Hörsch, Zoltán Szigeti:
The complexity of 2-vertex-connected orientation in mixed graphs. Discret. Optim. 48(Part 1): 100774 (2023) - Sven Jäger
:
An improved greedy algorithm for stochastic online scheduling on unrelated machines. Discret. Optim. 47: 100753 (2023) - G. Jaykrishnan
, Asaf Levin
:
EPTAS for load balancing problem on parallel machines with a non-renewable resource. Discret. Optim. 48(Part 1): 100775 (2023) - Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
:
On cut polytopes and graph minors. Discret. Optim. 50: 100807 (2023) - Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Maximizing the Mostar index for bipartite graphs and split graphs. Discret. Optim. 48(Part 1): 100768 (2023) - K. Subramani
, Piotr Wojciechowski:
Optimal length cutting plane refutations of integer programs. Discret. Optim. 50: 100806 (2023) - Zoltán Szigeti:
Packing mixed hyperarborescences. Discret. Optim. 50: 100811 (2023)
skipping 630 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-07-11 14:07 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