Остановите войну!
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 54 matches
- 2023
- Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk:
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. ICALP 2023: 27:1-27:20 - 2022
- Tiziana Calamoneri, Blerina Sinaimeri:
Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk). WALCOM 2022: 3-14 - Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Adversarial Formal Semantics of Attack Trees and Related Problems. GandALF 2022: 162-177 - 2021
- Shimin Jing, Xin Zheng, Zhengwen Chen:
Review and Investigation of Merkle Tree's Technical Principles and Related Application Fields. CAIBDA 2021: 86-90 - Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang:
Delay-Constrained Minimum Shortest Path Trees and Related Problems. COCOA 2021: 676-686 - 2020
- Abdulyekeen T. Adebisi, Venkateswarlu Gonuguntla, Ho-Won Lee, Kalyana C. Veluvolu:
Identification of Dementia Related Brain Functional Networks with Minimum Spanning Trees. BIBM 2020: 1761-1768 - Jesper Nederlof:
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices. Treewidth, Kernels, and Algorithms 2020: 145-164 - 2019
- Tiziana Calamoneri, Angelo Di Mambro, Blerina Sinaimeri:
Comparing Related Phylogenetic Trees. ICTCS 2019: 8-13 - 2018
- Daniel M. Kane, Shachar Lovett, Shay Moran:
Near-optimal linear decision trees for k-SUM and related problems. STOC 2018: 554-563 - 2017
- M. Wehenkel, Christine Bastin, Christophe Phillips, Pierre Geurts:
Tree ensemble methods and parcelling to identify brain areas related to Alzheimer's disease. PRNI 2017: 1-4 - 2016
- Christopher John Steele, Adele H. Marshall, Anne Kouvonen, Frank Kee, Reijo Sund:
Modelling the Time Taken to Experience a Type 2 Diabetes Related Complication Using a Survival Tree in Order to Advise General Practitioners. CBMS 2016: 271-272 - 2015
- Yu (Ledell) Wu, Per Austrin, Toniann Pitassi, David Liu:
Inapproximability of Treewidth and Related Problems (Extended Abstract). IJCAI 2015: 4222-4228 - Elena Khramtcova, Evanthia Papadopoulou:
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. ISAAC 2015: 404-414 - Luis Eduardo Pérez-Bernal, Jorge Arturo Pardiñas-Mir, Omar Guerra, Javier de la Mora, Mauricio Pimienta, Nestor Hernandez, Manuel de Atocha Lopez:
A Wireless Sensor Network System - For Monitoring Trees' Health Related Parameters in a University Campus. WINSYS 2015: 42-47 - 2013
- Séverine Habert, Parmeshwar Khurd, Christophe Chefd'Hotel:
Registration of multiple temporally related point sets using a novel variant of the coherent point drift algorithm: application to coronary tree matching. Medical Imaging: Image Processing 2013: 86690M - 2012
- Per Austrin, Toniann Pitassi, Yu Wu:
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems. APPROX-RANDOM 2012: 13-24 - Dieter Mitsche, Guillem Perarnau:
On the treewidth and related parameters of random geometric graphs. STACS 2012: 408-419 - 2011
- Pegah Kamousi, Subhash Suri:
Stochastic Minimum Spanning Trees and Related Problems. ANALCO 2011: 107-116 - Klaus Meer:
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. CSR 2011: 247-260 - Joseph Naor, Debmalya Panigrahi, Mohit Singh:
Online Node-Weighted Steiner Tree and Related Problems. FOCS 2011: 210-219 - 2010
- YuanYuan Li, Michael G. Thomason, Lynne E. Parker:
Detecting time-related changes in Wireless Sensor Networks using symbol compression and Probabilistic Suffix Trees. IROS 2010: 2946-2951 - Joachim Spoerhase:
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems. ISAAC (1) 2010: 440-450 - Cristina Bazgan, Sonia Toubaline, Zsolt Tuza:
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. IWOCA 2010: 154-166 - 2009
- Sándor Vágvölgyi:
On Ranges of Bottom-up Tree Transducers. Automata, Formal Languages, and Related Topics 2009: 129-143 - Martin Fürer:
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. ESA 2009: 11-22 - Jesper Nederlof:
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. ICALP (1) 2009: 713-725 - Norbert Beckmann, Bernhard Seeger:
A revised r*-tree in comparison with related index structures. SIGMOD Conference 2009: 799-812 - 2008
- Pascal Vaillant:
A Layered Grammar Model: Using Tree-Adjoining Grammars to Build a Common Syntactic Kernel for Related Dialects. TAG 2008: 157-164 - 2007
- Tommy Färnqvist, Peter Jonsson:
Bounded Tree-Width and CSP-Related Problems. ISAAC 2007: 632-643 - 2006
- Yoji Kajitani:
Theory of placement by numDAG related with single-sequence, SP, BSG, and O-tree. ISCAS 2006
skipping 24 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-04-25 05:45 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