„parameterized“

Suchergebnisse

1.641 Treffer

• Parameterized Algorithms and Kernels for Rainbow Matching
  Gupta, Sushmita ; Roy, Sanjukta ; Saurabh, Saket ; Zehavi, Meirav 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simultaneous Feedback Vertex Set: A Parameterized Perspective
  Agrawal, Akanksha ; Lokshtanov, Daniel ; Mouawad, Amer E. ; Saurabh, Saket 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Aspects of Strong Subgraph Closure
  Golovach, Petr A. ; Heggernes, Pinar ; Konstantinidis, Athanasios L. ; Lima, Paloma T. ; Papadopoulos, Charis
• Parameterized Complexity of Directed Spanner Problems
  Fomin, Fedor V. ; Golovach, Petr A. ; Lochet, William ; Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani
• The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration
  Dell, Holger ; Komusiewicz, Christian ; Talmon, Nimrod ; Weller, Mathias 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Classifications of twin star solutions for a constant speed of sound parameterized equation of state
  Christian, Jan-Erik ; Zacchi, Andreas ; Schaffner-Bielich, Jürgen
• Efficient iterative maximum likelihood estimation of high-parameterized time series models
  Hautsch, Nikolaus ; Okhrin, Ostap ; Ristig, Alexander 2014 Univ.-Bibliothek Frankfurt am Main
• Algorithms and computation – 6th international workshop ; proceedings
  Rahman, Md. Saidur ; Nakano, Shin-ichi 2012 Springer
• Chebyshev HOPGD with sparse grid sampling for parameterized linear systems
  Correnty, Siobhán ; 1078780900 ; Soodhalter, Kirk M.
• Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
  Pilipczuk, Marcin ; Pilipczuk, Michal ; Sankowski, Piotr ; van Leeuwen, Erik Jan 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity (Dagstuhl Seminar 01311)
  Downey, R. G. ; Fellows, Michael R. ; Niedermeier, Rolf ; Rossmanith, Peter 2002 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition (Dagstuhl Seminar 24411)
  Fomin, Fedor V. ; Marx, Dániel ; Saurabh, Saket ; Sharma, Roohani ; Kundu, Madhumita
• Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
  Bentert, Matthias ; Heeger, Klaus ; Koana, Tomohiro 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Packing Cycles Faster Than Erdos-Posa
  Lokshtanov, Daniel ; Mouawad, Amer E. ; Saurabh, Saket ; Zehavi, Meirav 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Tight bounds for Parameterized Complexity of Cluster Editing
  Fomin, Fedor V. ; Kratsch, Stefan ; Pilipczuk, Marcin ; Pilipczuk, Michal ; Villanger, Yngve 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Model checking parameterized asynchronous shared-memory systems
  Durand-Gasselin, Antoine ; Esparza, Javier ; Ganty, Pierre ; Majumdar, Rupak
• Connecting the Dots (with Minimum Crossings)
  Agrawal, Akanksha ; Guśpiel, Grzegorz ; Madathil, Jayakrishnan ; Saurabh, Saket ; Zehavi, Meirav 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity of Small Weight Automorphisms and Isomorphisms
  Arvind, V. ; Köbler, Johannes ; Kuhnert, Sebastian ; Torán, Jacobo
• Approximation and Parameterized Algorithms for Scheduling Problems
  Fischer, David Simon ; Jansen, Klaus ; Verschae, José 2025 Universitätsbibliothek Kiel
• Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket ; Thilikos, Dimitrios M. 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik