François Brucker

Orcid: 0000-0002-2971-1207

According to our database1, François Brucker authored at least 14 papers between 2001 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Binary set systems and totally balanced hypergraphs.
Discret. Appl. Math., 2021

2020
Totally Balanced Dissimilarities.
J. Classif., 2020

2018
Binary Lattices.
Proceedings of the 6th International Workshop "What can FCA do for Artificial Intelligence"? co-located with International Joint Conference on Artificial Intelligence and European Conference on Artificial Intelligence (IJCAI/ECAI 2018), 2018

2017
An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension.
Electron. Notes Discret. Math., 2017

2016
Approximate Seriation Problem in Formal Context Analysis.
Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, 2016

2015
Totally Balanced Formal Context Representation.
Proceedings of the Formal Concept Analysis - 13th International Conference, 2015

2011
Crown-free Lattices and Their Related Graphs.
Order, 2011

2009
Parsimonious cluster systems.
Adv. Data Anal. Classif., 2009

2008
Binary clustering.
Discret. Appl. Math., 2008

2007
Combinatorial optimisation and hierarchical classifications.
Ann. Oper. Res., 2007

2006
Sub-dominant theory in numerical taxonomy.
Discret. Appl. Math., 2006

2005
From hypertrees to arboreal quasi-ultrametrics.
Discret. Appl. Math., 2005

2004
Combinatorial optimization and hierarchical classifications.
4OR, 2004

2001
NP-hard Approximation Problems in Overlapping Clustering.
J. Classif., 2001


  Loading...