„Graph Algorithms“

Suchergebnisse

3.156 Treffer

• Differentially Private Algorithms for Graphs Under Continual Observation
  Fichtenberger, Hendrik ; Henzinger, Monika ; Ost, Lara 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting
  Cohen-Addad, Vincent ; Klein, Philip N. ; Marx, Dániel ; Wheeler, Archer ; Wolfram, Christopher 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics
  Fischer, Manuela ; Ghaffari, Mohsen 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments
  Chimani, Markus ; Hedtke, Ivo ; Wiedera, Tilo 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders
  Georgiadis, Loukas ; Italiano, Giuseppe F. ; Karanasiou, Aikaterini 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Better Process Mapping and Sparse Quadratic Assignment
  Schulz, Christian ; Träff, Jesper Larsson 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201)
  Hanauer, Kathrin ; Naumann, Uwe ; Pothen, Alex ; Schreiber, Robert
• Scalable Graph Mining and Learning (Dagstuhl Seminar 23491)
  Koutra, Danai ; Meyerhenke, Henning ; Safro, Ilya ; Brandt-Tumescheit, Fabian
• Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422)
  Li, Jason ; Panigrahi, Debmalya ; Sanita, Laura ; Saranurak, Thatchaphol
• Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331)
  Karypis, George ; Schulz, Christian ; Strash, Darren ; Ajwani, Deepak ; Bisseling, Rob H. ; Casel, Katrin ; Çatalyürek, Ümit V. ; Chevalier, Cédric ; Chudigiewitsch, Florian ; Faraj, Marcelo Fonseca ; Fellows, Michael ; Gottesbüren, Lars ; Heuer, Tobias ; Kaya, Kamer ; Lacki, Jakub ; Langguth, Johannes ; Li, Xiaoye Sherry ; Mayer, Ruben ; Meintrup, Johannes ; Mizutani, Yosuke ; Pellegrini, François ; Petrini, Fabrizio ; Rosamond, Frances ; Safro, Ilya ; Schlag, Sebastian ; Sharma, Roohani ; Sullivan,
• A Solution to Co-occurrence Bias in Pedestrian Attribute Recognition: Theory, Algorithms, and Improvements
  Zhou, Yibo ; Hu, Hai-Miao ; Yu, Jinzuo ; Wu, Haotian ; Pu, Shiliang ; Wang, Hanzi
• Scheduling Computing Tasks on Smartphones: Comparative Case Studies of Metaheuristic Algorithms on Real World Applications
  Tripathi, Pramod ; Sasidhar, Kalyan ; Mistry, Harsh ; Shah, Vyom
• Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
  Ponce, Moises ; Herrman, Rebekah ; Lotshaw, Phillip C. ; Powers, Sarah ; Siopsis, George ; Humble, Travis ; Ostrowski, James
• O(1)-Round MPC Algorithms for Multi-Dimensional Grid Graph Connectivity, Euclidean MST and DBSCAN
  Gan, Junhao ; Wirth, Anthony ; Zhang, Zhuo 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Colorful Vertex Recoloring of Bipartite Graphs
  Patt-Shamir, Boaz ; Rosén, Adi ; Umboh, Seeun William 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cluster Editing on Cographs and Related Classes
  Lafond, Manuel ; López Sánchez, Alitzel ; Luo, Weidong 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal
  Gaikwad, Ajinkya ; Kumar, Hitendra ; Maity, Soumen ; Saurabh, Saket ; Sharma, Roohani 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Noisy (Binary) Searching: Simple, Fast and Correct
  Dereniowski, Dariusz ; Łukasiewicz, Aleksander ; Uznański, Przemysław 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Local Density and Its Distributed Approximation
  Christiansen, Aleksander Bjørn ; van der Hoog, Ivor ; Rotenberg, Eva 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
  Alipour, Sharareh ; Farokhnejad, Ermiya ; Mömke, Tobias 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik