Остановите войну!
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 50 matches
- 2004
- Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic:
Coloring Octrees. COCOON 2004: 62-71 - Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. COCOON 2004: 259-267 - Tatsuya Akutsu:
Algorithms for Point Set Matching with k-Differences. COCOON 2004: 249-258 - Lars Arge:
External Geometric Data Structures. COCOON 2004: 1 - Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos:
Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON 2004: 290-299 - Fabien Baille, Evripidis Bampis, Christian Laforest:
Maximization of the Size and the Weight of Schedules of Degradable Intervals. COCOON 2004: 219-228 - Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation. COCOON 2004: 210-218 - L. Sunil Chandran, N. S. Narayanaswamy:
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. COCOON 2004: 151-160 - Zhi-Zhong Chen:
New Bounds on the Number of Edges in a k-Map Graph. COCOON 2004: 319-328 - Danny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama:
Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain. COCOON 2004: 238-248 - Francis Y. L. Chin, Jianbo Qian, Cao An Wang:
Progress on Maximum Weight Triangulation. COCOON 2004: 53-61 - Ferdinando Cicalese, Christian Deppe, Daniele Mundici:
Q-Ary Ulam-Rényi Game with Weighted Constrained Lies. COCOON 2004: 82-91 - Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger:
The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277 - Ying Du, Danny Z. Chen, Xiaodong Wu:
Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study. COCOON 2004: 112-121 - Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji:
Approximated Vertex Cover for Graphs with Perfect Matchings. COCOON 2004: 132-142 - Jesper Jansson, Wing-Kin Sung:
Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. COCOON 2004: 462-472 - Michael Kaminski, Tony Tan:
Regular Expressions for Languages over Infinite Alphabets. COCOON 2004: 171-178 - Jeong Han Kim:
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. COCOON 2004: 2 - Jin Wook Kim, Kunsoo Park:
An Efficient Local Alignment Algorithm for Masked Sequences. COCOON 2004: 440-449 - Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki:
Necessary and Sufficient Numbers of Cards for the Transformation Protocol. COCOON 2004: 92-101 - Hanno Lefmann:
Large Triangles in the d-Dimensional Unit-Cube. COCOON 2004: 43-52 - Ho-fung Leung, Zeshan Peng, Hing-Fung Ting:
An Efficient Online Algorithm for Square Detection. COCOON 2004: 432-439 - Shuai Cheng Li, Hon Wai Leong, Steven K. Quek:
New Approximation Algorithms for Some Dynamic Storage Allocation Problems. COCOON 2004: 339-348 - Shuguang Li, Guojun Li, Shaoqiang Zhang:
Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines. COCOON 2004: 229-237 - Andrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu:
Transshipment Through Crossdocks with Inventory and Time Windows. COCOON 2004: 122-131 - Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center Problems with Minimum Coverage. COCOON 2004: 349-359 - Andrew Lim, Fan Wang, Zhou Xu:
On the Selection and Assignment with Minimum Quantity Commitments. COCOON 2004: 102-111 - Meena Mahajan, Raghavan Rama, Vijayakumar Sundarrajan:
Towards Constructing Optimal Strip Move Sequences. COCOON 2004: 33-42 - Kazuyuki Miura, Machiko Azuma, Takao Nishizeki:
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs. COCOON 2004: 309-318 - Malgorzata Moczurad, Wlodzimierz Moczurad:
Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes. COCOON 2004: 72-81
skipping 20 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-29 19:37 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