Остановите войну!
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
- 2014
- Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Synchronized Dancing of Oblivious Chameleons. FUN 2014: 113-124 - Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Happy Edges: Threshold-Coloring of Regular Lattices. FUN 2014: 28-39 - Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta:
Classic Nintendo Games Are (Computationally) Hard. FUN 2014: 40-51 - Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting Houses of Pareto Optimal Matchings in the House Allocation Problem. FUN 2014: 301-312 - Paolo Boldi:
Algorithmic Gems in the Data Miner's Cave. FUN 2014: 1-15 - Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes:
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. FUN 2014: 52-63 - Michael Brand:
No Easy Puzzles: A Hardness Result for Jigsaw Puzzles. FUN 2014: 64-73 - Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. FUN 2014: 74-88 - Ke Chen, Adrian Dumitrescu:
Nonconvex Cases for Carpenter's Rulers. FUN 2014: 89-99 - Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
How to go Viral: Cheaply and Quickly. FUN 2014: 100-112 - Vladimir G. Deineko, Gerhard J. Woeginger:
Another Look at the Shoelace TSP: The Case of Very Old Shoes. FUN 2014: 125-136 - Erik D. Demaine, Martin L. Demaine:
Fun with Fonts: Algorithmic Typography. FUN 2014: 16-27 - Erik D. Demaine, Fermi Ma, Erik Waingarten:
Playing Dominoes Is Hard, Except by Yourself. FUN 2014: 137-146 - Palash Dey, Prachi Goyal, Neeldhara Misra:
UNO Gets Easier for a Single Player. FUN 2014: 147-157 - Jannik Dreier, Hugo Jonker, Pascal Lafourcade:
Secure Auctions without Cryptography. FUN 2014: 158-170 - Harrah Essed, Wei Therese:
The Harassed Waitress Problem. FUN 2014: 325-339 - Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz:
Towards an Algorithmic Guide to Spiral Galaxies. FUN 2014: 171-182 - Rudolf Fleischer, Tao Zhang:
Competitive Analysis of the Windfall Game. FUN 2014: 183-193 - Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc:
Excuse Me! or The Courteous Theatregoers' Problem - (Extended Abstract). FUN 2014: 194-205 - Vincenzo Gervasi, Giuseppe Prencipe, Valerio Volpi:
Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives. FUN 2014: 206-217 - Kazuya Haraguchi, Hirotaka Ono:
Approximability of Latin Square Completion-Type Puzzles. FUN 2014: 218-229 - Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi:
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN 2014: 230-239 - Minghui Jiang, Pedro J. Tejada, Haitao Wang:
Quell. FUN 2014: 240-251 - Barbara Keller, David Peleg, Roger Wattenhofer:
How Even Tiny Influence Can Have a Big Impact! FUN 2014: 252-263 - Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk:
Optimizing Airspace Closure with Respect to Politicians' Egos. FUN 2014: 264-276 - Sven Oliver Krumke, Florian D. Schwahn, Clemens Thielen:
Being Negative Makes Life NP-hard (for Product Sellers). FUN 2014: 277-288 - Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski:
Clearing Connections by Few Agents. FUN 2014: 289-300 - Takaaki Mizuki, Hiroki Shizuya:
Practical Card-Based Cryptography. FUN 2014: 313-324 - Giovanni Viglietta:
Lemmings Is PSPACE-Complete. FUN 2014: 340-351 - Bang Ye Wu:
Finding Centers and Medians of a Tree by Distance Queries. FUN 2014: 352-363
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-07-24 04:15 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