![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/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 61 matches
- 2014
- Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
:
Approximation Algorithms Inspired by Kernelization Methods. ISAAC 2014: 479-490 - Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman
, Pavel Valtr:
Reconstructing Point Set Order Typesfrom Radial Orderings. ISAAC 2014: 15-26 - Ei Ando, Shuji Kijima
:
An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral. ISAAC 2014: 376-386 - Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Throughput Maximization in Multiprocessor Speed-Scaling. ISAAC 2014: 247-258 - Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph Orientation and Flows over Time. ISAAC 2014: 741-752 - Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi
, Matsuo Konagaya, Hirotaka Ono
, Yota Otachi
, Pascal Schweitzer
, Jun Tarui, Ryuhei Uehara
:
Depth-First Search Using O(n) Bits. ISAAC 2014: 553-564 - Pawan Aurora
, Shashank K. Mehta:
A Geometric Approach to Graph Isomorphism. ISAAC 2014: 674-685 - Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
:
Speed-Scaling with No Preemptions. ISAAC 2014: 259-269 - Ruben Becker
, Andreas Karrenbauer
:
A Simple Efficient Interior Point Method for Min-Cost Flow. ISAAC 2014: 753-765 - Therese Biedl, Stefan Huber
, Peter Palfrader:
Planar Matchings for Weighted Straight Skeletons. ISAAC 2014: 117-127 - Cecilia Bohler, Chih-Hung Liu
, Evanthia Papadopoulou
, Maksym Zavershynskyi:
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams. ISAAC 2014: 27-37 - Prosenjit Bose
, Karim Douïeb, John Iacono
, Stefan Langerman
:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. ISAAC 2014: 181-192 - Prosenjit Bose
, Pat Morin
, André van Renssen
:
The Price of Order. ISAAC 2014: 313-325 - Laurent Bulteau
, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. ISAAC 2014: 298-309 - Zhanpeng Cheng, David Eppstein:
Linear-Time Algorithms for Proportional Apportionment. ISAAC 2014: 581-592 - Maxime Crochemore
, Costas S. Iliopoulos, Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
:
Covering Problems for Partial Words and for Indeterminate Strings. ISAAC 2014: 220-232 - Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
Dynamic and Multi-Functional Labeling Schemes. ISAAC 2014: 141-153 - Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang
, Takehiro Ito, Hirotaka Ono
, Yota Otachi
, Ryuhei Uehara
, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. ISAAC 2014: 389-400 - Nevzat Onur Domaniç
, C. Gregory Plaxton:
Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties. ISAAC 2014: 646-657 - Pål Grønås Drange
, Markus Sortland Dregi, Pim van 't Hof
:
On the Computational Complexity of Vertex Integrity and Component Order Connectivity. ISAAC 2014: 285-297 - Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel
:
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. ISAAC 2014: 81-93 - Hicham El-Zein, J. Ian Munro, Venkatesh Raman:
Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. ISAAC 2014: 543-552 - Stefan Felsner, Alexander Pilz
:
Ham-Sandwich Cuts for Abstract Order Types. ISAAC 2014: 726-737 - Peter Floderus, Jesper Jansson
, Christos Levcopoulos
, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. ISAAC 2014: 65-78 - Ken C. K. Fong, Minming Li
, Hongyu Liang, Linji Yang, Hao Yuan:
Average-Case Complexity of the Min-Sum Matrix Product Problem. ISAAC 2014: 41-52 - Jakub Gajarský, Petr Hlinený
, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. ISAAC 2014: 441-451 - Leszek Gasieniec, Christos Levcopoulos
, Andrzej Lingas:
Efficiently Correcting Matrix Products. ISAAC 2014: 53-64 - Alexander Gavruskin
, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu
:
Dynamic Interval Scheduling for Multiple Machines. ISAAC 2014: 235-246 - Pawel Gawrychowski, Damian Rusak:
Euclidean TSP with Few Inner Points in Linear Space. ISAAC 2014: 701-713 - Pratik Ghosal
, Meghana Nasre
, Prajakta Nimbhorkar
:
Rank-Maximal Matchings - Structure and Algorithms. ISAAC 2014: 593-605
skipping 31 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/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-31 15: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