Остановите войну!
for scientists:
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 29 matches
- 2004
- Karen I. Aardal:
Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration. J. Comb. Optim. 8(2): 147-149 (2004) - Alexander A. Ageev, Maxim Sviridenko:
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. J. Comb. Optim. 8(3): 307-328 (2004) - Egon Balas:
Logical Constraints as Cardinality Rules: Tight Representation. J. Comb. Optim. 8(2): 115-128 (2004) - Valmir Carneiro Barbosa, Carlos A. G. Assis, Josina O. do Nascimento:
Two Novel Evolutionary Formulations of the Graph Coloring Problem. J. Comb. Optim. 8(1): 41-63 (2004) - Valmir Carneiro Barbosa, Luciana C. D. Campos:
A Novel Evolutionary Formulation of the Maximum Independent Set Problem. J. Comb. Optim. 8(4): 419-437 (2004) - Gerard J. Chang, Chiuyuan Chen, Yaping Chen:
Vertex and Tree Arboricities of Graphs. J. Comb. Optim. 8(3): 295-306 (2004) - Bo Chen, Xiaotie Deng, Wenan Zang:
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. J. Comb. Optim. 8(1): 85-95 (2004) - Chuangyin Dang, Liying Kang:
Batch-Processing Scheduling with Setup Times. J. Comb. Optim. 8(2): 137-146 (2004) - Elena Fernández, Oscar Meza:
Even Cycles and Perfect Matching Problems with Side Constraints. J. Comb. Optim. 8(3): 381-396 (2004) - Antonio Frangioni, Emiliano Necciari, Maria Grazia Scutellà:
A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems. J. Comb. Optim. 8(2): 195-220 (2004) - Toshihiro Fujito:
On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. J. Comb. Optim. 8(4): 439-452 (2004) - Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich:
Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. J. Comb. Optim. 8(1): 13-28 (2004) - Clemens Heuberger:
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results. J. Comb. Optim. 8(3): 329-361 (2004) - Mhand Hifi:
Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems. J. Comb. Optim. 8(1): 65-84 (2004) - Hans Kellerer, Ulrich Pferschy:
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. J. Comb. Optim. 8(1): 5-11 (2004) - Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners:
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. J. Comb. Optim. 8(3): 267-294 (2004) - Guohui Lin, Tao Jiang:
A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition. J. Comb. Optim. 8(2): 183-194 (2004) - Andrea Lodi, Silvano Martello, Daniele Vigo:
Models and Bounds for Two-Dimensional Level Packing Problems. J. Comb. Optim. 8(3): 363-379 (2004) - Oleg A. Prokopyev, Panos M. Pardalos:
On Approximability of Boolean Formula Minimization. J. Comb. Optim. 8(2): 129-135 (2004) - Oleg A. Prokopyev, Panos M. Pardalos:
Minimum elsilon-equivalent Circuit Size Problem. J. Comb. Optim. 8(4): 495-502 (2004) - Frédéric Roupin:
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems. J. Comb. Optim. 8(4): 469-493 (2004) - Subhash C. Sarin, Divya Prakash:
Equal Processing Time Bicriteria Scheduling on Parallel Machines. J. Comb. Optim. 8(3): 227-240 (2004) - Shyong Jian Shyu, Yin-Te Tsai, Richard C. T. Lee:
The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction. J. Comb. Optim. 8(4): 453-468 (2004) - Michael Malmros Sørensen:
b-Tree Facets for the Simple Graph Partitioning Polytope. J. Comb. Optim. 8(2): 151-170 (2004) - Bang Ye Wu:
Constructing the Maximum Consensus Tree from Rooted Triples. J. Comb. Optim. 8(1): 29-39 (2004) - Jun-Ming Xu:
Wide Diameters of Cartesian Product Graphs and Digraphs. J. Comb. Optim. 8(2): 171-181 (2004) - Jinbo Xu, Ming Li, Ying Xu:
Protein Threading by Linear Programming: Theoretical Analysis and Computational Results. J. Comb. Optim. 8(4): 403-418 (2004) - Boting Yang, Cao An Wang:
Minimal Tetrahedralizations of a Class of Polyhedra. J. Comb. Optim. 8(3): 241-265 (2004) - Xiao Zhou, Takao Nishizeki:
Algorithm for the Cost Edge-Coloring of Trees. J. Comb. Optim. 8(1): 97-108 (2004)
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 2024-06-03 23:11 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