We stand with Ukraine  

Pascal Weber

Orcid: 0000-0003-1542-9865

Affiliations:
  • University of Vienna, Faculty of Computer Science, Austria
  • University of Ulm, Institute of Theoretical Computer Science, Germany (former)


According to our database1, Pascal Weber authored at least 9 papers between 2019 and 2025.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
DISCO: Internal Evaluation of Density-Based Clustering.
[BibTeX]
[DOI]
Anna Beer
,
Lena Krieger
,
Pascal Weber
,
Martin Ritzert
,
Ira Assent
,
Claudia Plant
CoRR, March, 2025

I Want 'Em All (At Once) - Ultrametric Cluster Hierarchies.
[BibTeX]
[DOI]
Andrew Draganov
,
Pascal Weber
,
Rasmus Skibdahl Melanchton Jørgensen
,
Anna Beer
,
Claudia Plant
,
Ira Assent
CoRR, February, 2025

Sc-GRIP: a Graph Convolutional Approach to Infer Gene Interaction Polarity from Single-Cell Data.
[BibTeX]
[DOI]
Carolina E. Atria
,
Yitao Cai
,
Pascal Weber
,
Anna Beer
,
Nils M. Kriege
,
Christian Boehm
,
Roger Revilla-i-Domingo
,
Claudia Plant
Proceedings of the IEEE International Conference on Data Mining, 2025

2024
SHADE: Deep Density-based Clustering.
[BibTeX]
[DOI]
Anna Beer
,
Pascal Weber
,
Lukas Miklautz
,
Collin Leiber
,
Walid Durani
,
Christian Böhm
,
Claudia Plant
Proceedings of the IEEE International Conference on Data Mining, 2024

2023
CaFe DBSCAN: A Density-based Clustering Algorithm for Causal Feature Learning.
[BibTeX]
[DOI]
Pascal Weber
,
Lukas Miklautz
,
Akshey Kumar
,
Moritz Grosse-Wentrup
,
Claudia Plant
Proceedings of the 10th IEEE International Conference on Data Science and Advanced Analytics, 2023

2022
Deep Clustering With Consensus Representations.
[BibTeX]
[DOI]
Lukas Miklautz
,
Martin Teuffenbach
,
Pascal Weber
,
Rona Perjuci
,
Walid Durani
,
Christian Böhm
,
Claudia Plant
Proceedings of the IEEE International Conference on Data Mining, 2022

2021
Coordinate Systems for Pangenome Graphs based on the Level Function and Minimum Path Covers.
[BibTeX]
[DOI]
Thomas Büchler
,
Caroline Räther
,
Pascal Weber
,
Enno Ohlebusch
Proceedings of the 14th International Joint Conference on Biomedical Engineering Systems and Technologies, 2021

2020
Edge Minimization in de Bruijn Graphs.
[BibTeX]
[DOI]
Uwe Baier
,
Thomas Büchler
,
Enno Ohlebusch
,
Pascal Weber
Proceedings of the Data Compression Conference, 2020

2019
On the Computation of Longest Previous Non-overlapping Factors.
[BibTeX]
[DOI]
Enno Ohlebusch
,
Pascal Weber
Proceedings of the String Processing and Information Retrieval, 2019


  Loading...