• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 76 matches

• 2024
• 
  Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
  Correlation Clustering with Vertex Splitting. SWAT 2024: 8:1-8:17
• 
  Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt:
  Overlapping and Robust Edge-Colored Clustering in Hypergraphs. WSDM 2024: 143-151
• 
  Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
  Correlation Clustering with Vertex Splitting. CoRR abs/2402.10335 (2024)
• 
  Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan:
  Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. CoRR abs/2407.00251 (2024)
• 
  Aditya Bhaskara, Alex Crane, Md. Mumtahin Habib Ullah Mazumder, Blair D. Sullivan, Prasanth Yalamanchili:
  Optimizing Information Access in Networks via Edge Augmentation. CoRR abs/2407.02624 (2024)
• 2023
• 
  Felix Reidl, Blair D. Sullivan:
  A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes. Algorithmica 85(8): 2318-2347 (2023)
• 
  Shweta Jain, Yosuke Mizutani, Blair D. Sullivan:
  An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition. ACDA 2023: 119-133
• 
  Ashkan Bashardoust, Sorelle A. Friedler, Carlos Scheidegger, Blair D. Sullivan, Suresh Venkatasubramanian:
  Reducing Access Disparities in Networks using Edge Augmentation✱. FAccT 2023: 1635-1651
• 
  Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf:
  Cluster Editing with Overlapping Communities. IPEC 2023: 2:1-2:12
• 
  Yosuke Mizutani, David Dursteler, Blair D. Sullivan:
  PACE Solver Description: Hydra Prime. IPEC 2023: 36:1-36:5
• 
  Andrew Fraser, Brian Lavallee, Blair D. Sullivan:
  Parameterized Complexity of Gerrymandering. SAGT 2023: 127-141
• 
  Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt:
  Overlapping and Robust Edge-Colored Clustering in Hypergraphs. CoRR abs/2305.17598 (2023)
• 
  Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
  Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023)
• 
  George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
  Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023)
• 2022
• 
  Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan:
  On the threshold of intractability. J. Comput. Syst. Sci. 124: 1-25 (2022)
• 
  Yosuke Mizutani, Blair D. Sullivan:
  Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph. IPEC 2022: 23:1-23:18
• 
  Yosuke Mizutani, Annie Staker, Blair D. Sullivan:
  Minimizing Congestion for Balanced Dominators. KDD 2022: 1264-1274
• 
  Andrew Fraser, Brian Lavallee, Blair D. Sullivan:
  Gerrymandering Trees: Parameterized Hardness. CoRR abs/2205.06857 (2022)
• 
  Shweta Jain, Yosuke Mizutani, Blair D. Sullivan:
  Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality. CoRR abs/2206.07286 (2022)
• 
  Yosuke Mizutani, Blair D. Sullivan:
  Improved Parameterized Complexity of Happy Set Problems. CoRR abs/2207.06623 (2022)
• 
  Ashkan Bashardoust, Sorelle A. Friedler, Carlos Eduardo Scheidegger, Blair D. Sullivan, Suresh Venkatasubramanian:
  Reducing Access Disparities in Networks using Edge Augmentation. CoRR abs/2209.07616 (2022)
• 2021
• 
  Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan:
  Polynomial Treedepth Bounds in Linear Colorings. Algorithmica 83(1): 361-386 (2021)
• 
  Timothy D. Goodrich, Eric Horton, Blair D. Sullivan:
  An Updated Experimental Evaluation of Graph Bipartization Methods. ACM J. Exp. Algorithmics 26: 12:1-12:24 (2021)
• 
  Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan:
  Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. ACDA 2021: 111-122
• 
  Michael Bender, John Gilbert, Bruce Hendrickson, Blair D. Sullivan:
  Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021, Virtual Conference, July 19-21, 2021. SIAM 2021, ISBN 978-1-61197-683-0 [contents]
• 
  Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan:
  Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. CoRR abs/2106.00657 (2021)
• 
  Michael Breen-McKay, Brian Lavallee, Blair D. Sullivan:
  Hardness of the Generalized Coloring Numbers. CoRR abs/2112.10562 (2021)
• 
  Yosuke Mizutani, Annie Staker, Blair D. Sullivan:
  Sparse dominating sets and balanced neighborhood partitioning. CoRR abs/2112.10973 (2021)
• 
  Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan:
  Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). Dagstuhl Reports 11(8): 115-128 (2021)
• 2020
• 
  Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel:
  Approximating Vertex Cover using Structural Rounding. ALENEX 2020: 70-80

skipping 46 more matches