Preface of STACS 2019 Special Issue

to connected objects

Language: Englisch

Identifier: 1238141749

Contributor

Niedermeier, Rolf
Paul, Christophe

DOI: 10.14279/depositonce-12157

URN: http://nbn-resolving.org/urn:nbn:de:101:1-2021080402101140287082

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 26.01.2023, 1:57 PM CET

Data provider

Deutsche Nationalbibliothek

Show original at data provider

Associated

Niedermeier, Rolf
Paul, Christophe

Other Objects (12)

A refined complexity analysis of fair districting over graphs

The power of linear-time data reduction for maximum matching

Co-Clustering under the Maximum Norm

Multistage s–t Path: Confronting Similarity with Dissimilarity

Multistage vertex cover

Comparing temporal graphs using dynamic time warping

Parameterized dynamic cluster editing

h-Index manipulation by undoing merges

A multivariate complexity analysis of the material consumption scheduling problem

Monografie

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Monografie

Classic graph problems made temporal – a parameterized complexity analysis

$Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods$

Monografie

Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods

A refined complexity analysis of fair districting over graphs

The power of linear-time data reduction for maximum matching

Co-Clustering under the Maximum Norm

Multistage s–t Path: Confronting Similarity with Dissimilarity

Multistage vertex cover

Comparing temporal graphs using dynamic time warping

Parameterized dynamic cluster editing

h-Index manipulation by undoing merges

A multivariate complexity analysis of the material consumption scheduling problem

Monografie

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Monografie

Classic graph problems made temporal – a parameterized complexity analysis

$Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods$

Monografie

Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods

A refined complexity analysis of fair districting over graphs

The power of linear-time data reduction for maximum matching

Co-Clustering under the Maximum Norm

Multistage s–t Path: Confronting Similarity with Dissimilarity

Multistage vertex cover

Comparing temporal graphs using dynamic time warping

Parameterized dynamic cluster editing

h-Index manipulation by undoing merges

A multivariate complexity analysis of the material consumption scheduling problem

Monografie

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Monografie

Classic graph problems made temporal – a parameterized complexity analysis

$Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods$

Monografie

Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods

Create user account

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

* I have read the terms of use and the privacy policy for the collection of personal data and accept them.

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

The culture search engine

Preface of STACS 2019 Special Issue

Object Details

Contributors, Location and Time

Further information

Data provider

Associated

Other Objects (12)

A refined complexity analysis of fair districting over graphs

The power of linear-time data reduction for maximum matching

Co-Clustering under the Maximum Norm

Multistage s–t Path: Confronting Similarity with Dissimilarity

Multistage vertex cover

Comparing temporal graphs using dynamic time warping

Parameterized dynamic cluster editing

h-Index manipulation by undoing merges

A multivariate complexity analysis of the material consumption scheduling problem

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Classic graph problems made temporal – a parameterized complexity analysis

Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods

A refined complexity analysis of fair districting over graphs

The power of linear-time data reduction for maximum matching

Co-Clustering under the Maximum Norm

Multistage s–t Path: Confronting Similarity with Dissimilarity

Multistage vertex cover

Comparing temporal graphs using dynamic time warping

Parameterized dynamic cluster editing

h-Index manipulation by undoing merges

A multivariate complexity analysis of the material consumption scheduling problem

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Classic graph problems made temporal – a parameterized complexity analysis

Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods

A refined complexity analysis of fair districting over graphs

The power of linear-time data reduction for maximum matching

Co-Clustering under the Maximum Norm

Multistage s–t Path: Confronting Similarity with Dissimilarity

Multistage vertex cover

Comparing temporal graphs using dynamic time warping

Parameterized dynamic cluster editing

h-Index manipulation by undoing merges

A multivariate complexity analysis of the material consumption scheduling problem

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Classic graph problems made temporal – a parameterized complexity analysis

Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods

Related objects