◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Liedloff

5 papers hereh-index 18958 citations66 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author3

Across the 3 of 5 papers where every author was matched, so the position is known.

fields
  • cs.DS3
  • cs.CC2

identity via Semantic Scholar / OpenAlex

activity
20082022
most citedExact Exponential Time Algorithms for Max Internal Spanning Tree

7 citations · 9 across the 5 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

cs.DS2012

On Finding Optimal Polytrees

Serge Gaspers, Mikko Koivisto, Mathieu Liedloff +2

Inferring probabilistic networks from data is a notoriously difficult task. Under various goodness-of-fit measures, finding an optimal network is NP-hard, even if restricted to pol…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.