CSC14: The Sixth SIAM Workshop on
Combinatorial Scientific Computing

The Sixth SIAM Workshop on Combinatorial Scientific Computing will take place on
July 21-23, 2014 at École Normale Supérieure de Lyon, Lyon, France. The meeting will take place at ENS-Lyon, site MONOD whose address is 46 allee d'Italie.

The Sixth SIAM Workshop on Combinatorial Scientific Computing, CSC14, will provide a forum for researchers interested in the interaction of combinatorial mathematics and algorithms with scientific computing to discuss current developments in research. CSC14 follows five earlier CSC workshops held in 2004, 2005, 2007, 2009, and 2011. The First SIAM Workshop on Combinatorial Scientific Computing (CSC04) was held in San Francisco in 2004; CSC05 was held in Toulouse, France in 2005; the CSC07 was held in Costa Mesa, CA; CSC09 was held in Seaside, CA; and CSC11 was held in Darmstadt, Germany. Each of these workshops was attended by close to a hundred participants, and featured about twenty-five plenary and selected talks.

The CSC14 Workshop's focus is on combinatorial mathematics and algorithms in high performance computing, broadly interpreted. The workshop will feature three invited talks, a number of contributed talks, and a poster session.

Important dates:

February 15 February 26, 2014Deadline for abstract submissions
March 15, 2014: Notification of acceptance
March 21, 2014: Deadline for applying for travel support (see below)
April 8, 2014Registration is open
May 2, 2014: Deadline for poster submissions
May 16, 2014: Early registration ends
May 19, 2014: Notification of acceptance (of posters)
July 14, 2014:Last day for registration
July 21-23, 2014:Workshop


Start[ End) 21 July 22 July 23 July
08:50 AM 09:00 AM Welcoming talk Good morning Good morning
09:00 AM 09:50 AM IT1 IT2 IT3
09:50 AM 10:15 AM CT1 CT14 CT24
10:15 AM 10:40 AM Break Break Break
10:40 AM 11:05 AM CT2 CT15 CT25
11:05 AM 11:30 AM CT3 CT16 CT26
11:30 AM 11:55 AM CT4 CT17 CT27
11:55 AM 01:30 PM Lunch Lunch Lunch
01:30 PM 01:55 PM CT5 CT18 Closing
01:55 PM 02:20 PM CT6 CT19
02:20 PM 02:45 PM CT7 CT20
02:45 PM 03:10 PM CT8 CT21
03:10 PM 03:35 PM CT9 Break
03:35 PM 04:00 PM Break CT22
04:00 PM 04:25 PM CT10 CT23
04:25 PM 04:50 PM CT11 Posters
04:50 PM 05:15 PM CT12 Posters
05:15 PM 05:40 PM CT13 Business meeting

Social event
IT: Invited Talks CT: Contributed talks

ID Speaker Title/abstract
IT1 Tamara G. Kolda Analytical and Algorithmic Challenges in Network Analysis (abs)
IT2 Petros Drineas Randomized Algorithms in Numerical Linear Algebra (RandNLA) and Applications in Data Analysis (abs)
IT3 Sivan Toledo Graphs and Linear Algebra: The New Randomized Kaczmarz Linear Solver (abs)

ID Authors Title/abstract
CT1 Esmond Ng and Barry Peyton Fast implementation of the minimum local fill ordering heuristic (abs)
CT2 Roland Glantz, Henning Meyerhenke, Peter Sanders and Christian Schulz Improving Coarsening for Multilevel Partitioning of Complex Networks (abs)
CT3 Mehmet Deveci, Kamer Kaya, Bora Uçar and Ümit V. Çatalyürek Partitioning hypergraphs for multiple communication metrics (abs)
CT4 R. Oguz Selvitopi, Volkan Yazici, Ata Turk and Cevdet Aykanat Comparison of One-Phase and Two-Phase Approaches for Replicated Hypergraph Partitioning (abs)
CT5 Mu Wang, Assefaw Gebremedhin and Alex Pothen An Efficient Automatic Differentiation Algorithm for Hessians: Working With Live Variables (abs)
CT6 Joris Gillis and Moritz Diehl Hierarchical seeding for efficient sparsity pattern recovery in automatic dierentiation (abs)
CT7 Jonathan Hogg and Jennifer Scott Compressed threshold pivoting for sparse symmetric indefinite systems (abs)
CT8 Cleve Ashcraft and Iain Duff Max flow, min cuts and multisectors (abs)
CT9 Astrid Casadei, Pierre Ramet and Jean Roman Nested dissection with balanced halo (abs)
CT10 Hadi Pouransari and Eric Darve Adaptive FMM for fractal sets (abs)
CT11 Julie Anton, Pierre L'Eplattenier and Cleve Ashcraft Multicenter method (abs)
CT12 Yves Ineichen, Costas Bekas and Alessandro Curioni Scalable Large Scale Graph Analytics (abs)
CT13 Julian Hall and Miles Lubin A distributed parallel dual revised simplex solver for large scale stochastic MIP problems (abs)
CT14 Grey Ballard, James Demmel, Andrew Gearhart, Benjamin Lipshitz, Oded Schwartz and Sivan Toledo Contention Bounds for Combinations of Computation Graphs and Network Topologies (abs)
CT15 Albert-Jan Yzelman Generalised vectorisation for sparse matrix--vector multiplication (abs)
CT16 Adam Lugowski and John R. Gilbert Efficient Sparse Matrix-Matrix Multiplication on Multicore Architectures (abs)
CT17 R. Oguz Selvitopi, Mustafa Ozdal and Cevdet Aykanat Scaling Iterative Solvers by Avoiding Latency Overhead of Parallel Sparse Matrix Vector Multiplication (abs)
CT18 Jesse Laeuchli and Andreas Stathopoulos Computing an estimate of Trace(A^(-1)) using hierarchical probing and matrix sparsification (abs)
CT19 Christian Staudt and Henning Meyerhenke NetworKit: An Interactive Tool for High-Performance Network Analysis (abs)
CT20 Michael Wolf and Benjamin Miller Detecting Anomalies in Very Large Graphs (abs)
CT21 Vladimir Ufimtsev and Sanjukta Bhowmick Finding High Betweenness Centrality Vertices in Large Networks (abs)
CT22 Zizhen Chen and David Matula Partitioning RGG's Into Disjoint (1-ε) Dominant Bipartite Subgraphs (abs)
CT23 Patrick R. Amestoy, Jean-Yves L'Excellent and Wissam M. Sid-Lakhdar Characterizing asynchronous broadcast trees for multifrontal factorizations (abs)
CT24 Erik Boman, Kevin Deweese and John Gilbert Comparing Different Cycle Bases for a Laplacian Solver (abs)
CT25 Michael Luelfesmann and Martin Buecker An Efficient Graph Coloring Algorithm for Stencil-based Jacobian Computations (abs)
CT26 Arif Khan, Mahantesh Halappanavar, Fredrik Manne and Alex Pothen Computing Approximate b-Matchings in Parallel (abs)
CT27 Thap Panitanarak and Kamesh Madduri Performance Analysis of Single-source Shortest Path Algorithms on Distributed-memory Systems

ID Authors Title
P2 E. Kartal Tabak, B. Barla Cambazoglu and Cevdet Aykanat Improving the runtime efficiency and solution quality of independent task assignment heuristics (abs)
P3 Hervé Deleau, Julien Loiseau, Christophe Jaillet, Michaël Krajecki, Luiz Angelo Steffenel, and François Alin Towards the Parallel Resolution of the Langford Problem on a Cluster of GPU Devices (abs)
P5 Sébastien Morais, Eric Angel, Cédric Chevalier, Franck Ledoux and Damien Regnault Linear Programming for Mesh Partitioning under Memory Constraint : Theoretical Formulations and Experimentations (abs)
P6 Marcelo Carrion, Brenno Lugon, Maria Cristina Rangel, Lucia Catabriga and Maria Claudia Boeres Optimizing the inexact Newton Krylov method using combinatorial approaches (abs)
P7 Brenno Lugon and Lucia Catabriga Large sparse matrix reordering schemes applied to a finite element analysis (abs)
P8 Hélène Coullon and Rob Bisseling Network Partitioning in Scientific Simulations (abs)
P9 Enver Kayaaslan and Bora Uçar Reducing elimination tree height for unsymmetric matrices (abs)
P10 Yingjun Deng, Anne Barros, and Antoine Grall On Newton's method for an inverse first passage problem (abs)

Program Committee

Organizing committee co-chairs

Paul Hovland, Argonne National Laboratory, USA
Bora Uçar, CNRS and ENS Lyon, France

Local organization

Evelyne Blesle, INRIA and ENS Lyon, France
Bora Uçar, CNRS and ENS Lyon, France

Organizing committee

Sanjukta Bhowmick, University of Nebraska Omaha, USA
Rob Bisseling, Utrecht University, the Netherlands
Erik Boman, Sandia National Laboratories, USA
Martin Bücker, University of Jena, Germany
Ümit V. Çatalyürek, The Ohio State University, USA
Assefaw Gebremedhin, Purdue University, USA
John Gilbert, University of California, Santa Barbara, USA
Laura Grigori, INRIA, France
Jean-Yves L'Excellent, INRIA, France
Sven Leyffer, Argonne National Laboratory, USA
X. Sherry Li, Lawrence Berkeley National Laboratory, USA
Lek-Heng Lim, University of Chicago, USA
Padma Raghavan, Pennsylvania State University, USA
Jennifer Scott, Rutherford Appleton Laboratory, UK
Blair Sullivan, North Carolina State University, USA
Miroslav Tůma, Academy of Sciences, Czech Republic

Steering Committee

Patrick R. Amestoy, INPT(ENSEEIHT)-IRIT, France
Rob Bisseling, Utrecht University, the Netherlands
Bruce Hendrickson, Sandia National Laboratories, USA
Paul Hovland, Argonne National Laboratory, USA
Alex Pothen, Purdue University, USA

Invited speakers

Petros Drineas, Rensselaer Polytechnic Institute

Tamara G. Kolda, Sandia National Laboratories

Sivan Toledo, Tel-Aviv University

Abstract Submissions (closed)

The authors of the extended abstract submissions are notified.

Poster Submissions (open)

We invite 1-page abstracts for poster presentations. The submissions are through EasyChair, please follow this link.


No registration fee. Participants should register at the registration web site.


We have partial funding for the conference expenses, and this would be used to keep the local costs low (please refer to the registration web site).

Travel Funds: