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 55 matches
- 2010
- Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood:
Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discret. Math. Theor. Comput. Sci. 12(1): 75-86 (2010) - Jorge Almeida, Ondrej Klíma:
New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages. Discret. Math. Theor. Comput. Sci. 12(4): 41-58 (2010) - Camino Balbuena, Xavier Marcote, Diego González-Moreno:
Some properties of semiregular cages. Discret. Math. Theor. Comput. Sci. 12(5): 125-138 (2010) - Taras O. Banakh, Artem Dudko, Dusan Repovs:
Symmetric monochromatic subsets in colorings of the Lobachevsky plane. Discret. Math. Theor. Comput. Sci. 12(1): 13-20 (2010) - Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard:
Covering codes in Sierpinski graphs. Discret. Math. Theor. Comput. Sci. 12(3): 63-74 (2010) - Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Jean-Luc Rémy:
On the number of balanced words of given length and height over a two letter alphabet. Discret. Math. Theor. Comput. Sci. 12(3): 41-62 (2010) - Therese Biedl, Michal Stern:
On edge-intersection graphs of k-bend paths in grids. Discret. Math. Theor. Comput. Sci. 12(1): 1-12 (2010) - Pawel Blasiak:
Combinatorial Route to Algebra: The Art of Composition & Decomposition. Discret. Math. Theor. Comput. Sci. 12(2) (2010) - Miklós Bóna:
The absence of a pattern and the occurrences of another. Discret. Math. Theor. Comput. Sci. 12(2): 89-102 (2010) - Mieczyslaw Borowiecki, Anna Fiedorowicz, Katarzyna Jesse-Józefczyk, Elzbieta Sidorowicz:
Acyclic colourings of graphs with bounded degree. Discret. Math. Theor. Comput. Sci. 12(1): 59-74 (2010) - Mireille Bousquet-Mélou:
The expected number of inversions after n adjacent transpositions. Discret. Math. Theor. Comput. Sci. 12(2): 65-88 (2010) - Milan Bradonjic, Tobias Müller, Allon G. Percus:
Coloring Geographical Threshold Graphs. Discret. Math. Theor. Comput. Sci. 12(3): 103-114 (2010) - David E. Brown, Arthur H. Busch, Garth Isaak:
Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs. Discret. Math. Theor. Comput. Sci. 12(5): 63-82 (2010) - Thomas Bruss:
On a Class of Optimal Stopping Problems with Mixed Constraints. Discret. Math. Theor. Comput. Sci. 12(2): 363-380 (2010) - Carmen C. Centeno, Simone Dantas, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Convex Partitions of Graphs induced by Paths of Order Three. Discret. Math. Theor. Comput. Sci. 12(5): 175-184 (2010) - Shu-Chiuan Chang, Lung-Chi Chen:
Structure of spanning trees on the two-dimensional Sierpinski gasket. Discret. Math. Theor. Comput. Sci. 12(3): 151-176 (2010) - Christian Choffrut, Achille Frigeri:
Deciding whether the ordering is necessary in a Presburger formula. Discret. Math. Theor. Comput. Sci. 12(1): 21-38 (2010) - Christian Choffrut, Robert George Mercas:
Contextual partial commutations. Discret. Math. Theor. Comput. Sci. 12(4): 59-72 (2010) - Ligia Loreta Cristea, Helmut Prodinger:
q-Enumeration of words by their total variation. Discret. Math. Theor. Comput. Sci. 12(3): 139-150 (2010) - James D. Currie, Narad Rampersad:
Cubefree words with many squares. Discret. Math. Theor. Comput. Sci. 12(3): 29-34 (2010) - Li Dong, Zhicheng Gao, Daniel Panario, L. Bruce Richmond:
Asymptotics of smallest component sizes in decomposable structures of alg-log type. Discret. Math. Theor. Comput. Sci. 12(2): 197-222 (2010) - Gérard Duchamp, Laurent Poinsot, Allan I. Solomon, Karol A. Penson, Pawel Blasiak, Andrzej Horzela:
Ladder Operators and Endomorphisms in Combinatorial Physics. Discret. Math. Theor. Comput. Sci. 12(2): 23-46 (2010) - Tínaz Ekim, Bernard Ries, Dominique de Werra:
Split-critical and uniquely split-colorable graphs. Discret. Math. Theor. Comput. Sci. 12(5): 1-24 (2010) - Stefan Felsner, Éric Fusy, Marc Noy:
Asymptotic enumeration of orientations. Discret. Math. Theor. Comput. Sci. 12(2): 249-262 (2010) - Stefan Felsner, Clemens Huemer, Sarah Kappes, David Orden:
Binary Labelings for Plane Quadrangulations and their Relatives. Discret. Math. Theor. Comput. Sci. 12(3): 115-138 (2010) - Fabrizio Frati:
Lower Bounds on the Area Requirements of Series-Parallel Graphs. Discret. Math. Theor. Comput. Sci. 12(5): 139-174 (2010) - Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev:
Crucial abelian k-power-free words. Discret. Math. Theor. Comput. Sci. 12(5): 83-96 (2010) - Michael Huber:
On the existence of block-transitive combinatorial designs. Discret. Math. Theor. Comput. Sci. 12(1): 122-132 (2010) - Hsien-Kuei Hwang, Michael Fuchs, Vytas Zacharovas:
Asymptotic variance of random symmetric digital search trees. Discret. Math. Theor. Comput. Sci. 12(2): 103-166 (2010) - Philippe Jacquet:
Non Unitary Random Walks. Discret. Math. Theor. Comput. Sci. 12(2): 333-362 (2010)
skipping 25 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-09-23 18:24 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