![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 36 matches
- 2013
- Jin Akiyama, Hyunwoo Seong:
An Algorithm for Determining Whether a Pair of Polygons Is Reversible. FAW-AAIM 2013: 2-3 - Pawan Aurora
, Sumit Singh, Shashank K. Mehta:
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds. FAW-AAIM 2013: 24-35 - Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
Two-Round Discrete Voronoi Game along a Line. FAW-AAIM 2013: 210-220 - Robert Bredereck, André Nichterlein, Rolf Niedermeier:
Pattern-Guided k-Anonymity. FAW-AAIM 2013: 350-361 - Shenshi Chen:
Monomial Testing and Applications. FAW-AAIM 2013: 106-117 - Zhi-Zhong Chen, Lusheng Wang
:
Faster Exact Computation of rSPR Distance. FAW-AAIM 2013: 36-47 - Fernanda Couto
, Luérbio Faria, Sulamita Klein, Fábio Protti, Loana Tito Nogueira
:
On (k, ℓ)-Graph Sandwich Problems. FAW-AAIM 2013: 187-197 - Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan:
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. FAW-AAIM 2013: 198-209 - Xiaojie Deng, Bingkai Lin, Chihao Zhang:
Multi-Multiway Cut Problem on Graphs of Bounded Branch Width. FAW-AAIM 2013: 315-324 - Dariusz Dereniowski
, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
Zero-Visibility Cops and Robber Game on a Graph. FAW-AAIM 2013: 175-186 - Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:
Expected Computations on Color Spanning Sets. FAW-AAIM 2013: 130-141 - Bin Fu:
On the Complexity of Approximate Sum of Sorted List. FAW-AAIM 2013: 284-293 - Xin Han, Yasushi Kawase, Kazuhisa Makino:
Randomized Algorithms for Removable Online Knapsack Problems. FAW-AAIM 2013: 60-71 - Yijie Han, Sanjeev Saxena:
Algorithms for Testing Length Four Permutations. FAW-AAIM 2013: 17-23 - Yumei Huo, Hairong Zhao:
Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints. FAW-AAIM 2013: 325-338 - Masaki Kawabata, Takao Nishizeki:
Spanning Distribution Trees of Graphs. FAW-AAIM 2013: 153-162 - Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon
:
On Edge-Independent Sets. FAW-AAIM 2013: 272-283 - Mark Korenblit, Vadim E. Levit
:
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. FAW-AAIM 2013: 94-105 - Marcin Krzywkowski:
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree. FAW-AAIM 2013: 12-16 - Longcheng Liu:
Inverse Maximum Flow Problems under the Combining Norms. FAW-AAIM 2013: 221-230 - Xianrong Liu, Wenhong Tian, Minxian Xu
, Qin Xiong:
A Cost-Efficient Scheduling Algorithm for Traffic Grooming. FAW-AAIM 2013: 241-249 - Min Lu, Tian Liu, Ke Xu:
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs. FAW-AAIM 2013: 142-152 - Ding Ma, Yunshu Gao:
Disjoint Small Cycles in Graphs and Bipartite Graphs. FAW-AAIM 2013: 4-11 - Carlos A. J. Martinhon, Luérbio Faria:
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs. FAW-AAIM 2013: 231-240 - Dániel Marx:
The Square Root Phenomenon in Planar Graphs. FAW-AAIM 2013: 1 - Jinghao Sun, Yakun Meng, Guozhen Tan:
A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem. FAW-AAIM 2013: 163-174 - Chaoyi Wang, Tian Liu, Ke Xu:
Large Hypertree Width for Sparse Random Hypergraphs. FAW-AAIM 2013: 294-302 - Yue-Li Wang, Kuo-Hua Wu, Ton Kloks:
On Perfect Absorbants in De Bruijn Digraphs. FAW-AAIM 2013: 303-314 - Tao-Ming Wang, Guang-Hui Zhang:
Zero-Sum Flow Numbers of Hexagonal Grids. FAW-AAIM 2013: 339-349 - Wei Wu, Chuan Luo, Kaile Su
:
FWLS: A Local Search for Graph Coloring. FAW-AAIM 2013: 84-93
skipping 6 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-20 14:30 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