• 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 40 matches

• 2020
• 
  Ahmed Al-Herz, Alex Pothen:
  A Parallel 2/3-Approximation Algorithm for Vertex-Weighted Matching. CSC 2020: 12-21
• 
  Mohsen Aznaveh, Jinhao Chen, Timothy A. Davis, Bálint Hegyi, Scott P. Kolodziej, Timothy G. Mattson, Gábor Szárnyas:
  Parallel GraphBLAS with OpenMP. CSC 2020: 138-148
• 
  Noam Birnbaum, Roy Nissim, Oded Schwartz:
  Fault Tolerance with High Performance for Fast Matrix Multiplication. CSC 2020: 106-117
• 
  Arne Bockhorn, Sri Hari Krishna Narayanan, Andrea Walther:
  Checkpointing Approaches for the Computation of Adjoints Covering Resilience Issues. CSC 2020: 22-31
• 
  Xin Cheng, Hemanta K. Maji, Alex Pothen:
  Graphs with Tunable Chromatic Numbers for Parallel Coloring. CSC 2020: 54-64
• 
  Cédric Chevalier, Franck Ledoux, Sébastien Morais:
  A Multilevel Mesh Partitioning Algorithm Driven by Memory Constraints. CSC 2020: 85-95
• 
  Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash:
  WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. CSC 2020: 1-11
• 
  Scott P. Kolodziej, Timothy A. Davis:
  Generalized Gains for Hybrid Vertex Separator Algorithms. CSC 2020: 96-105
• 
  Weiqi Li:
  Solution Attractor of Local Search System: A Method to Reduce Computational Complexity of the Traveling Salesman Problem. CSC 2020: 65-75
• 
  Huong Luu, Marek Chrobak:
  Modeling Fluid Mixing in Microfluidic Grids. CSC 2020: 149-159
• 
  Kelsey Maass, Arun V. Sathanur, Arif Khan, Robert Rallo:
  Street-level Travel-time Estimation via Aggregated Uber Data. CSC 2020: 76-84
• 
  Uwe Naumann:
  On Sparse Matrix Chain Products. CSC 2020: 118-127
• 
  Raluca Portase, Bora Uçar:
  Matrix symmetrization and sparse direct solvers. CSC 2020: 128-137
• 
  Mohammad-Ali Rostami, H. Martin Bücker:
  An Inexact Combinatorial Model for Maximizing the Number of Discovered Nonzero Entries. CSC 2020: 32-42
• 
  Cameron Ruggles, Nate Veldt, David F. Gleich:
  A Parallel Projection Method for Metric Constrained Optimization. CSC 2020: 43-53
• 
  H. Martin Bücker, Xiaoye Sherry Li, Sivasankaran Rajamanickam:
  Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, CSC 2020, Seattle, USA, February 11-13, 2020. SIAM 2020, ISBN 978-1-61197-622-9 [contents]
• 2018
• 
  Satoru Iwata, Taihei Oki, Mizuyo Takamatsu:
  Index Reduction for Differential-Algebraic Equations with Mixed Matrices. CSC 2018: 45-55
• 
  Rémi Barat, Cédric Chevalier, François Pellegrini:
  Multi-criteria Graph Partitioning with Scotch. CSC 2018: 66-75
• 
  Noam Birnbaum, Oded Schwartz:
  Fault Tolerant Resource Efficient Matrix Multiplication. CSC 2018: 23-34
• 
  Kevin Deweese, John R. Gilbert:
  Evolving Difficult Graphs for Laplacian Solvers. CSC 2018: 35-44
• 
  Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar:
  Approximation algorithms for maximum matchings in undirected graphs. CSC 2018: 56-65
• 
  S. M. Ferdous, Alex Pothen, Arif Khan:
  New Approximation Algorithms for Minimum Weighted Edge Cover. CSC 2018: 97-108
• 
  Mathias Jacquelin, Esmond G. Ng, Barry W. Peyton:
  Fast and effective reordering of columns within supernodes using partition refinement. CSC 2018: 76-86
• 
  Andrew Knyazev:
  On spectral partitioning of signed graphs. CSC 2018: 11-22
• 
  Yang Liu, Mathias Jacquelin, Pieter Ghysels, Xiaoye S. Li:
  Highly scalable distributed-memory sparse triangular solution algorithms. CSC 2018: 87-96
• 
  Uwe Naumann, Klaus Leppkes:
  Low-Memory Algorithmic Adjoint Propagation. CSC 2018: 1-10
• 
  Front Matter. CSC 2018
• 
  Fredrik Manne, Peter Sanders, Sivan Toledo:
  Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, CSC 2018, Bergen, Norway, June 6-8, 2018. SIAM 2018, ISBN 978-1-61197-521-5 [contents]
• 2016
• 
  Johannes Lotz, Uwe Naumann, Sumit Mitra:
  Mixed Integer Programming for Call Tree Reversal. CSC 2016: 83-91
• 
  Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke:
  Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. CSC 2016: 1-12

skipping 10 more matches