Остановите войну!
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 21 matches
- 2007
- Louigi Addario-Berry, Neil Olver, Adrian Vetta:
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. J. Graph Algorithms Appl. 11(1): 309-319 (2007) - Ulrik Brandes, Daniel Fleischer, Thomas Puppe:
Dynamic Spectral Layout with an Application to Small Worlds. J. Graph Algorithms Appl. 11(2): 325-343 (2007) - Sergio Cabello, Erik D. Demaine, Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths. J. Graph Algorithms Appl. 11(1): 259-276 (2007) - Donatello Conte, Pasquale Foggia, Mario Vento:
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs. J. Graph Algorithms Appl. 11(1): 99-143 (2007) - Alice M. Dean, William S. Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter:
Bar k-Visibility Graphs. J. Graph Algorithms Appl. 11(1): 45-59 (2007) - Peter Eades, Patrick Healy:
Guest Editor's Foreword. J. Graph Algorithms Appl. 11(2): 323-324 (2007) - Alon Efrat, Cesim Erten, Stephen G. Kobourov:
Fixed-Location Circular Arc Drawing of Planar Graphs. J. Graph Algorithms Appl. 11(1): 145-164 (2007) - David Eppstein:
The Traveling Salesman Problem for Cubic Graphs. J. Graph Algorithms Appl. 11(1): 61-81 (2007) - Athula Gunawardena, Robert R. Meyer:
Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs. J. Graph Algorithms Appl. 11(1): 83-98 (2007) - Stefan Hachul, Michael Jünger:
Large-Graph Layout Algorithms at Work: An Experimental Study. J. Graph Algorithms Appl. 11(2): 345-369 (2007) - Patrick Healy, Karol Lynch:
Building Blocks of Upward Planar Digraphs. J. Graph Algorithms Appl. 11(1): 3-44 (2007) - Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarassov:
A 2.5D Hierarchical Drawing of Directed Graphs. J. Graph Algorithms Appl. 11(2): 371-396 (2007) - Weidong Huang, Seok-Hee Hong, Peter Eades:
Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization. J. Graph Algorithms Appl. 11(2): 397-429 (2007) - Chun-Cheng Lin, Hsu-Chun Yen:
On Balloon Drawings of Rooted Trees. J. Graph Algorithms Appl. 11(2): 431-452 (2007) - Mauro Mezzini:
Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time. J. Graph Algorithms Appl. 11(1): 239-257 (2007) - Kerri Morgan, Graham Farr:
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems. J. Graph Algorithms Appl. 11(1): 165-193 (2007) - Andreas Noack:
Energy Models for Graph Clustering. J. Graph Algorithms Appl. 11(2): 453-480 (2007) - Charis Papadopoulos, Constantinos Voglis:
Drawing graphs using modular decomposition. J. Graph Algorithms Appl. 11(2): 481-511 (2007) - Marios Poulos, George Bokos, Nikolaos Kanellopoulos, Sozon Papavlasopoulos, Markos Avlonitis:
Specific Selection of FFT Amplitudes from Audio Sports and News Broadcasting for Classification Purposes. J. Graph Algorithms Appl. 11(1): 277-307 (2007) - Ben Roberts, Dirk P. Kroese:
Estimating the Number of s-t Paths in a Graph. J. Graph Algorithms Appl. 11(1): 195-214 (2007) - Xiaodong Wu, Michael B. Merickel:
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images. J. Graph Algorithms Appl. 11(1): 215-237 (2007)
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-24 14:36 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