![](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 32 matches
- 2001
- Eric Angel, Vassilis Zissimopoulos:
On the landscape ruggedness of the quadratic assignment problem. Theor. Comput. Sci. 263(1-2): 159-172 (2001) - Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
Partitioning vertices of 1-tough graphs into paths. Theor. Comput. Sci. 263(1-2): 255-261 (2001) - Edward G. Belaga:
Mod 3 arithmetic on triangulated Riemann surfaces. Theor. Comput. Sci. 263(1-2): 123-137 (2001) - Patrice Calégari, Frédéric Guidec, Pierre Kuonen, Frank Nielsen
:
Combinatorial optimization algorithms for radio network planning. Theor. Comput. Sci. 263(1-2): 235-245 (2001) - Philippe Cara, Serge Lehman, Dmitrii V. Pasechnik
:
On the number of inductively minimal geometries. Theor. Comput. Sci. 263(1-2): 31-35 (2001) - Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert:
Preface. Theor. Comput. Sci. 263(1-2): 1 (2001) - Szu-En Cheng, Ko-Wei Lih:
An improvement on a spernerity proof of Horrocks. Theor. Comput. Sci. 263(1-2): 355-377 (2001) - Guillaume Damiand
, Michel Habib
, Christophe Paul
:
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor. Comput. Sci. 263(1-2): 99-111 (2001) - Reinhardt Euler:
Characterizing bipartite Toeplitz graphs. Theor. Comput. Sci. 263(1-2): 47-58 (2001) - Odile Favaron, Y. Redouane:
Neighborhood unions and regularity in graphs. Theor. Comput. Sci. 263(1-2): 247-254 (2001) - Komei Fukuda, Alain Prodon, Tadashi Sakuma
:
Notes on acyclic orientations and the shelling lemma. Theor. Comput. Sci. 263(1-2): 9-16 (2001) - Mordecai J. Golin
:
A combinatorial approach to Golomb forests. Theor. Comput. Sci. 263(1-2): 283-304 (2001) - Rabah Harbane, Marie-Claude Heydemann:
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays. Theor. Comput. Sci. 263(1-2): 173-189 (2001) - Hsien-Kuei Hwang
:
Uniform asymptotics of some Abel sums arising in coding theory. Theor. Comput. Sci. 263(1-2): 145-158 (2001) - Frank K. Hwang:
A complementary survey on double-loop networks. Theor. Comput. Sci. 263(1-2): 211-229 (2001) - Claude Indermitte, Thomas M. Liebling, Marc Troyanov, Heinz Clémençon:
Voronoi diagrams on piecewise flat surfaces and an application to biological growth. Theor. Comput. Sci. 263(1-2): 263-274 (2001) - Gyula Károlyi, Vera Rosta:
Generalized and geometric Ramsey numbers for cycles. Theor. Comput. Sci. 263(1-2): 87-98 (2001) - Hao Li, Jianping Li:
Independent triangles covering given vertices of a graph. Theor. Comput. Sci. 263(1-2): 333-344 (2001) - Bor-Kuan Lu, Fang-Rong Hsu, Chuan Yi Tang:
Finding the shortest boundary guard of a simple polygon. Theor. Comput. Sci. 263(1-2): 113-121 (2001) - Hiroshi Maehara, Norihide Tokushige
:
When does a planar bipartite framework admit a continuous deformation? Theor. Comput. Sci. 263(1-2): 345-354 (2001) - Yannis Manoussakis, Zsolt Tuza:
Ramsey numbers for tournaments. Theor. Comput. Sci. 263(1-2): 75-85 (2001) - Bruno Martin
:
A simulation of cellular automata on hexagons by cellular automata on rings. Theor. Comput. Sci. 263(1-2): 231-234 (2001) - Yasuko Matsui, Tomomi Matsui
:
NP-completeness for calculating power indices of weighted majority games. Theor. Comput. Sci. 263(1-2): 305-310 (2001) - Seiya Negami
:
Note on Ramsey theorems for spatial graphs. Theor. Comput. Sci. 263(1-2): 205-210 (2001) - Frank Nielsen
:
On point covers of c-oriented polygons. Theor. Comput. Sci. 263(1-2): 17-29 (2001) - Michio Ozeki:
On the covering radius problem for ternary self-dual codes. Theor. Comput. Sci. 263(1-2): 311-332 (2001) - Dmitrii V. Pasechnik
:
On computing Hilbert bases via the Elliot-MacMahon algorithm. Theor. Comput. Sci. 263(1-2): 37-46 (2001) - Alain Quilliot:
Convexity and global optimization: a theoretical link. Theor. Comput. Sci. 263(1-2): 191-204 (2001) - Li-Da Tong, Frank K. Hwang, Gerard J. Chang
:
Channel graphs of bit permutation networks. Theor. Comput. Sci. 263(1-2): 139-143 (2001) - V. Yegnanarayanan
:
Graph colourings and partitions. Theor. Comput. Sci. 263(1-2): 59-74 (2001)
skipping 2 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-31 21:01 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