Arnaud Knippel

Orcid: 0000-0003-1281-4389

According to our database1, Arnaud Knippel authored at least 13 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Formulations for the maximum common edge subgraph problem.
Discret. Appl. Math., 2024

2022
Routine mining on location sequences.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 26th International Conference KES-2022, 2022

2020
The K-partitioning problem: Formulations and branch-and-cut.
Networks, 2020

2019
On graph Laplacian eigenvectors with components in {-1, 0, 1}.
Discret. Appl. Math., 2019

2018
Extraction and Clustering of Two-Dimensional Dialogue Patterns.
Int. J. Artif. Intell. Tools, 2018

2016
An extended edge-representative formulation for the K-partitioning problem.
Electron. Notes Discret. Math., 2016

Polyhedral combinatorics of the K-partitioning problem with representative variables.
Discret. Appl. Math., 2016

2015
Extraction de motifs dialogiques bidimensionnels.
Rev. d'Intelligence Artif., 2015

2011
Oscillations of simple networks
CoRR, 2011

2009
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming.
Proceedings of the 10th International Conference on Document Analysis and Recognition, 2009

2007
The multi-layered network design problem.
Eur. J. Oper. Res., 2007

2003
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem.
J. Heuristics, 2003

1999
Exact solution of multicommodity network optimization problems with general step cost functions.
Oper. Res. Lett., 1999


  Loading...