BIRD Home

The University Paris-Dauphine is specialized in the Organization and Decision Sciences, which cover a broad and coherent range of academic disciplines (Management, Economics, Law, Social sciences, Mathematics, Computer science, Linguistics). This repository provides access to the academic output of Dauphine research community in these fields (articles, books, chapters, communications, working papers, reports, theses).

Select a research centre to browse its collections.

CEREMADE (UMR CNRS 7534)

CEntre de REcherche en MAthématiques de la DEcision

Chaires d'entreprise

Publications produites dans le cadre des chaires d'entreprise pilotées ou co-pilotées par l'université Paris Dauphine-PSL

CICLaS (EA 4405)

Centre de recherche interdisciplinaire sur les Identités Culturelles et le Langues de Spécialités

Cr2D (EA 367)

Centre de recherche de Droit Dauphine

DRM (UMR CNRS 7088)

Dauphine Recherches en Management

IMRI

Institut pour le Management de la Recherche et de l'Innovation

IRISSO (UMR CNRS 7170)

Institut de Recherche Interdisciplinaire en Sciences Sociales

LAMSADE (UMR CNRS 7243)

Laboratoire d'Analyse et Modélisation de Systèmes pour l'Aide à la Décision

LEDa (UMR CNRS 8007, UMR IRD 260)

Laboratoire d'Economie de Dauphine

Recherches affiliées

On the Parameterized Complexity of Red-Blue Points Separation

Bonnet, Edouard; Giannopoulos, Panos; Lampis, Michael (2017) Communication / Conférence
Parameterized Orientable Deletion

Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Otachi, Yota; Sikora, Florian (2018) Article accepté pour publication ou publié
Multistage Matchings

Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael; Paschos, Vangelis (2018) Communication / Conférence
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

Bonnet, Edouard; Escoffier, Bruno; Paschos, Vangelis; Stamoulis, Giorgios (2016) Communication / Conférence
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems

Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis (2012) Document de travail / Working paper

Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD)

Research centres

Recently Added

On the Parameterized Complexity of Red-Blue Points Separation

Parameterized Orientable Deletion

Multistage Matchings

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

Subexponential and FPT-time Inapproximability of Independent Set and Related Problems

Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD)

Research centres

Recently Added

On the Parameterized Complexity of Red-Blue Points Separation ﻿

Parameterized Orientable Deletion ﻿

Multistage Matchings ﻿

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs ﻿

Subexponential and FPT-time Inapproximability of Independent Set and Related Problems ﻿

On the Parameterized Complexity of Red-Blue Points Separation

Parameterized Orientable Deletion

Multistage Matchings

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

Subexponential and FPT-time Inapproximability of Independent Set and Related Problems