activity
20082025
most citedA path following algorithm for the graph matching problem

2 citations · 3 across the 6 of their papers we have counts for

collaborators

6 papers

math.NA2025

Lippmann-Schwinger-Lanczos approach for inverse scattering problem of Schrodinger equation in the resonance frequency domain

Anarzhan Abilgazy, Mikhail Zaslavskiy

Reconstructions of potential in Schrodinger equation with data in the diffusion frequency domain have been successfully obtained within Lippmann-Schwinger-Lanczos (LSL) approach, h…

stat.ML2018

ToxicBlend: Virtual Screening of Toxic Compounds with Ensemble Predictors

Mikhail Zaslavskiy, Simon Jégou, Eric W. Tramel +1

Timely assessment of compound toxicity is one of the biggest challenges facing the pharmaceutical industry today. A significant proportion of compounds identified as potential lead…

stat.AP2017

Robust Detection of Covariate-Treatment Interactions in Clinical Trials

Baptiste Goujaud, Eric W. Tramel, Pierre Courtiol +2

Detection of interactions between treatment effects and patient descriptors in clinical trials is critical for optimizing the drug development process. The increasing volume of dat…

stat.ML2010

Many-to-Many Graph Matching: a Continuous Relaxation Approach

Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Vert

Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how t…

math.OC2009★ 1 cited

Global alignment of protein-protein interaction networks by graph matching methods

Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Vert

Aligning protein-protein interaction (PPI) networks of different species has drawn a considerable interest recently. This problem is important to investigate evolutionary conserved…

cs.CV2008★ 2 cited

A path following algorithm for the graph matching problem

Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Vert

We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted g…