Остановите войну!
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 32 matches
- 2020
- Hossein Boomari, Soheila Farokhi:
Computing Boundary Cycle of a Pseudo-Triangle Polygon from Its Visibility Graph. TTCS 2020: 61-71 - Mansoor Davoodi, Arman Rouhani, Maryam Sanisales:
Path Planning with Objectives Minimum Length and Maximum Clearance. TTCS 2020: 101-115 - Mona Emadi, Jafar Tanha:
Margin-Based Semi-supervised Learning Using Apollonius Circle. TTCS 2020: 48-60 - Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis:
On the Complexity of the Upper r-Tolerant Edge Cover Problem. TTCS 2020: 32-47 - Kian Mirjalali, Hamid Zarrabi-Zadeh:
Improved Algorithms for Distributed Balanced Clustering. TTCS 2020: 72-84 - MohammadSadegh Mohagheghi, Behrang Chaboki:
Dirac-Based Reduction Techniques for Quantitative Analysis of Discrete-Time Markov Models. TTCS 2020: 1-16 - Zeynab Sabahi-Kaviani, Fatemeh Ghassemi, Zahra Alimadadi:
Combining Machine and Automata Learning for Network Traffic Classification. TTCS 2020: 17-31 - Shaghayegh Tavassoli, Ramtin Khosravi, Ehsan Khamespanah:
Finite Interval-Time Transition System for Real-Time Actors. TTCS 2020: 85-100 - Luís Soares Barbosa, Mohammad Ali Abam:
Topics in Theoretical Computer Science - Third IFIP WG 1.8 International Conference, TTCS 2020, Tehran, Iran, July 1-2, 2020, Proceedings. Lecture Notes in Computer Science 12281, Springer 2020, ISBN 978-3-030-57851-0 [contents] - 2017
- Kasper Dokter, Farhad Arbab:
Exposing Latent Mutual Exclusion by Work Automata. TTCS 2017: 59-73 - Ardeshir Dolati:
A Characterization of Horoidal Digraphs. TTCS 2017: 11-25 - Saeid Hanifehnezhad, Ardeshir Dolati:
Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System. TTCS 2017: 26-33 - Mobarakeh Karimi, Massoud Aman, Ardeshir Dolati:
Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance. TTCS 2017: 34-40 - Luigi Liquori, Claude Stolze:
A Decidable Subtyping Logic for Intersection and Union Types. TTCS 2017: 74-90 - Peter Csaba Ölveczky:
Design and Validation of Cloud Storage Systems Using Formal Methods. TTCS 2017: 3-8 - Mohsen Safari, Ali Ebnenasir:
Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths. TTCS 2017: 43-58 - Tarmo Uustalu:
Container Combinatorics: Monads and Lax Monoidal Functors. TTCS 2017: 91-105 - Alimujiang Yasen, Kazunori Ueda:
Unification of Hypergraph \lambda -Terms. TTCS 2017: 106-124 - Mohammad Reza Mousavi, Jirí Sgall:
Topics in Theoretical Computer Science - Second IFIP WG 1.8 International Conference, TTCS 2017, Tehran, Iran, September 12-14, 2017, Proceedings. Lecture Notes in Computer Science 10608, Springer 2017, ISBN 978-3-319-68952-4 [contents] - 2016
- Mohammad Taghi Hajiaghayi, Mohammad Reza Mousavi:
Topics in Theoretical Computer Science - The First IFIP WG 1.8 International Conference, TTCS 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9541, Springer 2016, ISBN 978-3-319-28677-8 [contents] - 2015
- Davood Bakhshesh, Mohammad Farshi:
Some Properties of Continuous Yao Graph. TTCS 2015: 44-55 - Esma Balkir, Mehrnoosh Sadrzadeh, Bob Coecke:
Distributional Sentence Entailment Using Density Matrices. TTCS 2015: 1-22 - Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon. TTCS 2015: 56-71 - Hossein Boomari, Alireza Zarei:
Visibility Graphs of Anchor Polygons. TTCS 2015: 72-89 - Silvano Dal-Zilio, Bernard Berthomieu:
Automating the Verification of Realtime Observers Using Probes and the Modal mu-calculus. TTCS 2015: 90-104 - Anuj Dawar:
On Symmetric and Choiceless Computation. TTCS 2015: 23-29 - Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Minimizing Walking Length in Map Matching. TTCS 2015: 105-120 - Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang:
Rainbow Domination and Related Problems on Some Classes of Perfect Graphs. TTCS 2015: 121-134 - Tomer Kotek, Johann A. Makowsky:
Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. TTCS 2015: 135-146 - Mohammad Abouei Mehrizi, Mohammad Ghodsi, Azadeh Tabatabaei:
Robots' Cooperation for Finding a Target in Streets. TTCS 2015: 30-43
skipping 2 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-06 08:55 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