Остановите войну!
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 34 matches
- 2007
- Nair Maria Maia de Abreu, Pierre Hansen, Carla Silva Oliveira, Leonardo Silva de Lima:
Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex. CTW 2007: 1-4 - Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini:
Some flexibility problmes and their complexity. CTW 2007: 5-8 - Stephan Dominique Andres:
Directed defective asymmetric graph coloring games on forests. CTW 2007: 9-12 - Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks:
The valve location problem. CTW 2007: 13-16 - Paul S. Bonsma:
Most balanced minimum cuts and partially ordered knapsack. CTW 2007: 17-21 - Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. CTW 2007: 23-27 - Sofie Coene, Frits C. R. Spieksma:
A latency problem with profits. CTW 2007: 29-32 - Ulrich Faigle, Britta Peis:
A two-phase greedy algorithm for modular lattice polyhedra. CTW 2007: 33-37 - Jinfeng Feng:
A characterization for jump graphs containing complementary cycles. CTW 2007: 39-42 - Henning Fernau:
Dynamic programming for queen domination. CTW 2007: 43-48 - Ralf Gollmer, Uwe Gotzes, Frederike Neise, Rüdiger Schultz:
Stochastic programs with dominance contraints induced by mixed-integer linear recourse. CTW 2007: 49-51 - Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. CTW 2007: 53-55 - Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing for homogeneous items. CTW 2007: 57-60 - Erwin W. Hans:
Operations Research for hospital process optimization. CTW 2007: 61-61 - Irith Ben-Arroyo Hartman:
On path partitions and colourings in digraphs. CTW 2007: 63-66 - Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard:
On a network pricing problem with consecutive toll arcs. CTW 2007: 67-68 - Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra:
On revenue equivalence in truthful mechanisms. CTW 2007: 69-72 - Shahadat Hossain, Minhaz Fahim Zibran:
A multi-phase approach to the university course timetabling problem. CTW 2007: 73-76 - Johann L. Hurink, Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks. CTW 2007: 77-80 - Yulia Kempner, Vadim E. Levit:
Representation of poly-antimatroids. CTW 2007: 81-84 - Walter Kern, Xinhui Wang:
On full components for Rectilinear Steiner tree. CTW 2007: 85-88 - Jimmy Leblet, Jean-Xavier Rampon:
St-serie decomposition of orders. CTW 2007: 89-93 - Ruijuan Li, Shengjia Li, Jinfeng Feng:
The number of vertices whose out-arcs are pancyclic in 2-strong tournaments. CTW 2007: 95-97 - Shengjia Li, Wei Meng, Yubao Guo:
A local tournament contains a vertex whose out-arcs are g-pancyclic. CTW 2007: 99-102 - Leo Liberti:
A useful characterization of the feasible region of binary linear programs. CTW 2007: 103-106 - Vadim V. Lozin, Martin Milanic:
On the maximum independent set problem in subclasses of planar and more general graphs. CTW 2007: 107-110 - Dmitrii Lozovanu, Stefan Pickl:
Multiobjective hierarchical control of time-discrete systems and dtermining Stackelberg strategies. CTW 2007: 111-114 - Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti:
Fast point-to-point shortest path queries on dynamic road networks with interfal data. CTW 2007: 115-118 - Jacob Jan Paulus, Johann L. Hurink:
Decomposition method for project scheduling with adjacent resources. CTW 2007: 119-122 - Adriaan Peeters, Kris Coolsaet, Gunnar Brinkmann, Nicolas Van Cleemput, Veerle Fack:
GrInvIn for graph theory teaching and research. CTW 2007: 123-126
skipping 4 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 2024-05-18 17:44 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