„parameterized“

Suchergebnisse

1.000+ Treffer

• Kernels for Deletion to Classes of Acyclic Digraphs
  Agrawal, Akanksha ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Geometrically constrained isogeometric parameterized level-set based topology optimization via trimmed elements
  Wang, YingJun ; Benson, David J.
• Parameterization Above a Multiplicative Guarantee
  Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals
  Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A parameterized perspective on packing paths of length two
  Fernau, Henning ; Raible, Daniel
• Fuzzy parameterized fuzzy soft sets and decision making
  Zhu, Kuanyun ; Zhan, Jianming
• Parameterized Geometric Graph Modification with Disk Scaling
  Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay ; Saurabh, Saket ; Zehavi, Meirav 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth
  Kowalik, Łukasz ; Mucha, Marcin ; Nadara, Wojciech ; Pilipczuk, Marcin ; Sorge, Manuel ; Wygocki, Piotr 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Structural determination of complex natural products by quantum mechanical calculations of 13C NMR chemical shifts: development of a parameterized protocol for terpenes
  Albuquerque, Ana Carolina Ferreira de ; Ribeiro, Daniel Joras ; Amorim, Mauro Barbosa de
• Development of a groundwater flow model for the highly parameterized Qatar aquifers
  Baalousha, Husam Musa
• Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound
  Crowston, Robert ; Gutin, Gregory Z. ; Jones, Mark 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized complexity of weighted team definability
  Kontinen, Juha ; Mahmood, Yasir ; Meier, Arne ; Vollmer, Heribert 2024 Gottfried Wilhelm Leibniz Universität Hannover
• Temporal Graph Realization from Fastest Paths
  Klobas, Nina ; Mertzios, George B. ; Molter, Hendrik ; Spirakis, Paul G. 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithmic aspects of manipulation and anonymization in social choice and social networks
  Talmon, Nimrod ; Niedermeier, Rolf ; Rosenschein, Jeffrey S. ; Shachnai, Hadas 2016 Universitätsverlag der TU Berlin
• Combinatorial Optimization and Graph Algorithms – Communications of NII Shonan Meetings
  Fukunaga, Takuro ; Kawarabayashi, Ken-ichi 2017 Springer Singapore
• Simultaneous Feedback Edge Set: A Parameterized Perspective
  Agrawal, Akanksha ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simultaneous Feedback Edge Set: A Parameterized Perspective
  Agrawal, Akanksha ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav
• Parameterized algorithms for block-structured integer programs with large entries
  Cslovjecsek, Jana ; Koutecký, Martin ; Lassota, Alexandra ; Pilipczuk, Michał ; Polak, Adam
• Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability)
  Inamdar, Tanmay ; Lokshtanov, Daniel ; Saurabh, Saket ; Surianarayanan, Vaishali 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exploiting Dense Structures in Parameterized Complexity
  Lochet, William ; Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik