„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Deleting Vertices to Graphs of Bounded Genus
  Kociumaka, Tomasz ; Pilipczuk, Marcin
• Efficient Computation of Sequence Mappability
  Charalampopoulos, Panagiotis ; Iliopoulos, Costas S. ; Kociumaka, Tomasz ; Pissis, Solon P. ; Radoszewski, Jakub ; Straszyński, Juliusz
• Near-Optimal Search Time in $$\delta $$ δ -Optimal Space, and Vice Versa
  Kociumaka, Tomasz ; Navarro, Gonzalo ; Olivares, Francisco
• Runtime Analysis with Variable Cost
  Lehre, Per Kristian ; Sutton, Andrew M.
• Truthful Matching with Online Items and Offline Agents
  Feldman, Michal ; Fusco, Federico ; Leonardi, Stefano ; Mauras, Simon ; Reiffenhäuser, Rebecca
• The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
  Renssen, André van ; Sha, Yuan ; Sun, Yucheng ; Wong, Sampson
• Backdoors to q-Horn
  Gaspers, Serge ; Ordyniak, Sebastian ; Ramanujan, M. S. ; Saurabh, Saket ; Szeider, Stefan 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Abstracts Collection -- 25th International Symposium on Theoretical Aspects of Computer Science
  Albers, Susanne ; Weil, Pascal 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
  Lokshtanov, Daniel ; Mouawad, Amer E. ; Panolan, Fahad ; Siebertz, Sebastian
• Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
  Bilò, Davide ; Gualà, Luciano ; Leucci, Stefano ; Proietti, Guido
• Confluent Layered Drawings
  Eppstein, David ; Goodrich, Michael T. ; Meng, Jeremy Yu
• Triangle Counting in Dynamic Graph Streams
  Bulteau, Laurent ; Froese, Vincent ; Kutzkov, Konstantin ; Pagh, Rasmus
• Parameterized Complexity of Superstring Problems
  Bliznets, Ivan ; Fomin, Fedor V. ; Golovach, Petr A. ; Karpov, Nikolay ; Kulikov, Alexander S. ; Saurabh, Saket
• Holistic review of super resolution algorithms
  Goswami, Tilottama ; Tejaswi, Surya ; Aaki, Akash ; Rao, K. Ram Mohan
• LP can be a cure for Parameterized Problems
  Narayanaswamy, N.S. ; Raman, Venkatesh ; Ramanujan, M.S. ; Saurabh, Saket 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding Optimal Solutions with Neighborly Help
  Burjons, Elisabet ; Frei, Fabian ; Hemaspaandra, Edith ; Komm, Dennis ; Wehner, David
• Algorithms for Windowed Aggregations and Joins on Distributed Stream Processing Systems
  Verwiebe, Juliane ; Grulich, Philipp ; Traub, Jonas ; Markl, Volker
• Linear-Time Recognition of Double-Threshold Graphs
  Kobayashi, Yusuke ; Okamoto, Yoshio ; Otachi, Yota ; Uno, Yushi
• Connected Subgraph Defense Games
  Akrida, Eleni C. ; Deligkas, Argyrios ; Melissourgos, Themistoklis ; Spirakis, Paul G.
• Evaluating the effect of compressing algorithms for trajectory similarity and classification problems
  Makris, Antonios ; Silva, Camila Leite da ; Bogorny, Vania ; Alvares, Luis Otavio ; Macedo, Jose Antonio ; Tserpes, Konstantinos