Остановите войну!
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 35 matches
- 2018
- Ljiljana Brankovic, Joe Ryan, William F. Smyth:
Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10765, Springer 2018, ISBN 978-3-319-78824-1 [contents] - 2017
- Akanksha Agrawal:
On the Parameterized Complexity of Happy Vertex Coloring. IWOCA 2017: 103-115 - Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr, Birgit Vogtenhuber:
Holes in 2-Convex Point Sets. IWOCA 2017: 169-181 - Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra:
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. IWOCA 2017: 195-205 - Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to Answer a Small Batch of RMQs or LCA Queries in Practice. IWOCA 2017: 343-355 - Mai Alzamel, Costas S. Iliopoulos:
Recent Advances of Palindromic Factorization. IWOCA 2017: 37-46 - Martin Baca, Nurdin Hinding, Aisha Javed, Andrea Semanicová-Fenovcíková:
Entire H-irregularity Strength of Plane Graphs. IWOCA 2017: 3-12 - Nikolay A. Balonin, Jennifer Seberry:
A Construction for 0, 1, -1 Orthogonal Matrices Visualized. IWOCA 2017: 47-57 - Sergiu Carpov, Pascal Aubry, Renaud Sirdey:
A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits. IWOCA 2017: 275-286 - Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. IWOCA 2017: 61-74 - Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA 2017: 116-127 - Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximation Results for the Incremental Knapsack Problem. IWOCA 2017: 75-87 - Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Improved Complexity for Power Edge Set Problem. IWOCA 2017: 128-141 - Josep Domingo-Ferrer:
Privacy-Preserving and Co-utile Distributed Social Credit. IWOCA 2017: 371-382 - Diane M. Donovan, Thomas A. McCourt:
Combinatorial Questions: How Can Graph Labelling Help? IWOCA 2017: 13-23 - Henning Fernau:
Extremal Kernelization: A Commemorative Paper. IWOCA 2017: 24-36 - Cyriac Grigorious, Thomas Kalinowski, Sudeep Stephen:
On the Power Domination Number of de Bruijn and Kautz Digraphs. IWOCA 2017: 264-272 - Hanyu Gu, Julia Memar, Yakov Zinder:
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements. IWOCA 2017: 312-324 - Hovhannes A. Harutyunyan, Zhiyuan Li:
Improved Lower Bound on Broadcast Function Based on Graph Partition. IWOCA 2017: 219-230 - Andrei Kelarev, Jennifer Seberry, Leanne Rylands, Xun Yi:
Combinatorial Algorithms and Methods for Security of Statistical Databases Related to the Work of Mirka Miller. IWOCA 2017: 383-394 - Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal Sum Labeling of Graphs. IWOCA 2017: 252-263 - Rhydian Lewis, Kate Smith-Miles, Kyle Phillips:
The School Bus Routing Problem: An Analysis and Algorithm. IWOCA 2017: 287-298 - Vadim V. Lozin:
Graph Parameters and Ramsey Theory. IWOCA 2017: 185-194 - Sven Mallach:
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem. IWOCA 2017: 327-340 - Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Maxime Samson:
Fully Leafed Tree-Like Polyominoes and Polycubes. IWOCA 2017: 206-218 - Robin Milosz, Sylvie Hamel:
Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem. IWOCA 2017: 299-311 - Neeldhara Misra, I. Vinod Reddy:
The Parameterized Complexity of Happy Colorings. IWOCA 2017: 142-153 - Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA 2017: 397-408 - Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. IWOCA 2017: 409-419 - Hiroki Oshima:
Derandomization for k-Submodular Maximization. IWOCA 2017: 88-99
skipping 5 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-08-18 00: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