Остановите войну!
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 27 matches
- 2021
- Jorin Dornemann, Rainer Schrader:
Cross-series-parallel digraphs. Discret. Appl. Math. 303: 57-65 (2021) - Frank Gurski, Dominique Komander, Marvin Lindemann:
Oriented Vertex and Arc Coloring of Edge Series-Parallel Digraphs. OR 2021: 101-106 - Frank Gurski, Dominique Komander, Marvin Lindemann:
Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs. WALCOM 2021: 182-194 - 2020
- Kévin Perrot, Sylvain Sené, Lucas Venturini:
#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method. CiE 2020: 326-338 - Camille Noûs, Kévin Perrot, Sylvain Sené, Lucas Venturini:
#P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method. CoRR abs/2004.02129 (2020) - 2019
- Jing Huang, Josh Manzer:
Chronological rectangle digraphs which are two-terminal series-parallel. Discret. Appl. Math. 261: 246-257 (2019) - Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. CoRR abs/1905.03643 (2019) - 2013
- Stefan Gulan:
Series Parallel Digraphs with Loops - Graphs Encoded by Regular Expression. Theory Comput. Syst. 53(2): 126-158 (2013) - 2008
- Marcio Katsumi Oikawa:
Generation of algebraic expressions for business processes using reductions on series-parallel digraphs. University of São Paulo, Brazil, 2008 - 2007
- Ruzayn Quaddoura:
Linear Time Recognition Algorithms for Three Variants of Vertex Series Parallel Digraphs. FCS 2007: 121-131 - Md. Abul Hassan Samee, Md. Saidur Rahman:
Upward Planar Drawings of Series-Parallel Digraphs with Maximum Degree Three. WALCOM 2007: 28-45 - 2006
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006) - 2004
- Seok-Hee Hong, Peter Eades, Jonathan Hillman:
Linkless symmetric drawings of series parallel digraphs. Comput. Geom. 29(3): 191-221 (2004) - 2002
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. GD 2002: 162-173 - 2000
- Seok-Hee Hong, Peter Eades, Sang Ho Lee:
Drawing series parallel digraphs symmetrically. Comput. Geom. 17(3-4): 165-188 (2000) - Seok-Hee Hong, Peter Eades:
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. ISAAC 2000: 266-277 - Margaret Mitchell:
Use of Series Parallel Digraph Analysis in Generating Instructions for Multiple Users. VIP 2000: 85-86 - 1999
- Matthias Müller-Hannemann:
Drawing Trees, Series-Parallel Digraphs, and Lattices. Drawing Graphs 1999: 46-70 - 1998
- Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee:
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. GD 1998: 198-209 - 1995
- Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. SIAM J. Comput. 24(5): 970-1001 (1995) - Luca Baffi, Rossella Petreschi:
Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs. ASIAN 1995: 34-47 - 1994
- Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph. Int. J. Comput. Geom. Appl. 4(4): 385-402 (1994) - 1992
- Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph (Extended Abstract). SWAT 1992: 272-283 - 1989
- Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). WADS 1989: 352-372 - 1986
- Franz Rendl:
Quadratic assignment problems on series-parallel digraphs. Z. Oper. Research 30(3) (1986) - 1982
- Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler:
The Recognition of Series Parallel Digraphs. SIAM J. Comput. 11(2): 298-313 (1982) - 1979
- Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler:
The recognition of Series Parallel digraphs. STOC 1979: 1-12
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-10 15:56 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