„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Structural Parameterizations with Modulator Oblivion
  Jacob, Ashwin ; Panolan, Fahad ; Raman, Venkatesh ; Sahlot, Vibha
• Reconstructing Phylogenetic Trees from Multipartite Quartet Systems
  Hirai, Hiroshi ; Iwamasa, Yuni
• Learning Privately with Labeled and Unlabeled Examples
  Beimel, Amos ; Nissim, Kobbi ; Stemmer, Uri
• When Can Graph Hyperbolicity be Computed in Linear Time?
  Fluschnik, Till ; Komusiewicz, Christian ; Mertzios, George B. ; Nichterlein, André ; Niedermeier, Rolf ; Talmon, Nimrod
• Soft Computing in Data Analytics – Proceedings of International Conference on SCDA 2018
  Nayak, Janmenjoy ; Abraham, Ajith ; Krishna, B. Murali ; Chandra Sekhar, G. T. ; Das, Asit Kumar 2019 Springer Singapore
• Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
  Biedl, Therese ; Chan, Timothy M. ; Lee, Stephanie ; Mehrabi, Saeed ; Montecchiani, Fabrizio ; Vosoughpour, Hamideh ; Yu, Ziting
• Fault-Tolerant Approximate Shortest-Path Trees
  Bilò, Davide ; Gualà, Luciano ; Leucci, Stefano ; Proietti, Guido
• Spanning Trees in Multipartite Geometric Graphs
  Biniaz, Ahmad ; Bose, Prosenjit ; Eppstein, David ; Maheshwari, Anil ; Morin, Pat ; Smid, Michiel
• A General Bin Packing Game: Interest Taken into Account
  Wang, Zhenbo ; Han, Xin ; Dósa, György ; Tuza, Zsolt
• Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
  Bläsius, Thomas ; Karrer, Annette ; Rutter, Ignaz
• Crochemore’s Partitioning on Weighted Strings and Applications
  Barton, Carl ; Pissis, Solon P.
• Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
  Boehmer, Niclas ; Heeger, Klaus ; Niedermeier, Rolf 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Complexity of Recovering Incidence Matrices
  Fomin, Fedor V. ; Golovach, Petr ; Misra, Pranabendu ; Ramanujan, M. S. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Optimality of Pseudo-polynomial Algorithms for Integer Programming
  Fomin, Fedor V. ; Panolan, Fahad ; Ramanujan, M. S. ; Saurabh, Saket 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
  Koutecký, Martin ; Levin, Asaf ; Onn, Shmuel 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity Framework for Forbidden Subgraphs I: The Framework
  Johnson, Matthew ; Martin, Barnaby ; Oostveen, Jelle J. ; Pandey, Sukanya ; Paulusma, Daniel ; Smith, Siani ; van Leeuwen, Erik Jan
• Computational Counting (Dagstuhl Seminar 13031)
  Bürgisser, Peter ; Goldberg, Leslie Ann ; Jerrum, Mark ; Koiran, Pascal
• Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series
  Froese, Vincent ; Jain, Brijnesh ; Rymar, Maciej ; Weller, Mathias
• Bellman–Ford algorithm for solving shortest path problem of a network under picture fuzzy environment
  Parimala, Mani ; Broumi, Said ; Prakash, Karthikeyan ; Topal, Selçuk
• Temporal Network Optimization Subject to Connectivity Constraints
  Mertzios, George B. ; Michail, Othon ; Spirakis, Paul G.