Simple Search

Information about Privacy

This website uses Cookies so that we can provide you with the best user experience. We also collect and use personal data. Please see our Privacy Statement. By continuing to use this website you are agreeing to those conditions.

May we evaluate your usage of our website in order to optimize our offer?

Therefore we use Google Analytics. Further information you can find in our Privacy Statement. Your consent is voluntary, you can withdraw it anytime for the future by deleting the cookie GOOGLE_ANALYTICS_INFO.

No connection to the server of the library

The catalogue is currently not accessible. Try again later or contact your library.

Usage of Cookies

Our website needs cookies for a flawless procedure.
A cookie is a small text file which is placed on your computer or device by websites you visit or online services you use.
Below is a short description of cookies used by our application with details of the provider, a short description and their storage duration (if you don't block or delete them). The cookies do not collect personal data.

Necessary Cookies

Cookie	Provider	Description	Expires
COPAUTH	OCLC	The cookie stores a successful login.	10 years after creation
EU_LAW_INFO	OCLC	Is set when the user has acknowledged the usage of cookies in OPEN.	10 years after creation
.ASPXANONYMOUS	DNN	The cookie stores an unique ID für anonymous users.	approximately 70 days
.DOTNETNUKE	DNN	A DNN cookie which is created during login.	Session
ASP.NET_SessionId	ASP.NET	Identifies the session of ASP.NET.	Session
authentication	OCLC	Saves the registration way of the patron. DNN (= DNN Login), COP (= OPEN Login) "" (= Patron is not logged in)	Session
dnn_IsMobile	DNN	The cookie stores whether the user uses a mobile device (e.g. a smartphone).	Session
languague	DNN	The cookie stores the currently set language (e.g. de-DE).	Session
LastPageId	DNN	The cookie stores the ID (TabID) of the last visited tab.	Session
__RequestVerificationToken	DNN	The cookie offers protection against cross-site attacks.	Session
SplashPageView	DNN	The cookie controls the single display of the welcome page.	Session
RepeaterCategories, RepeaterGroup	DNNGo	Cookies of the DNN module xPlugin, for layout configuration.	Session

Optional Cookies

Cookie	Provider	Description	Expires
GOOGLE_ANALYTICS_INFO	OCLC	The cookie is set when the user has acknowledged the usage of the tracking tool Google Analytics.	1 year
_ga, _ga__<container-id>	Google Analytics	The cookie _ga saves the Google Analytics-Client-ID in order to distinguish users, _ga__<container-id> is used to persist session state (provided the user has acknowledged the tool, please refer to cookie GOOGLE_ANALYTICS_INFO).	2 years
_Module_359_Survey_0_, AppearanceSecurityOptions, CSVExportOptions	DNN	These cookies are used by the optional 3rd party DNN module Survey.	until 31.12.9999, 20 minutes, 20 minutes

Cookies of the Administration Section

Cookie	Provider	Description	Expires
List of all settings cookies of OPEN:	OCLC	The cookies control the unfolded/closed - status of the different settings sections as well as the visibility of the headers.	Session
StayInEditMode	DNN	The cookie controls the edit mode of the page.	Session
cem_pending, CEM_CallbackData, CEM_ExistingModule, CEM_NewModuleId	DNN	These cookies are saved when adding or duplicating a module during edit mode.	Session

X

Schloss Dagstuhl Library
Search Local Catalogue
eJournals

GO

|

Login

Sprache auswählen

Schloss Dagstuhl Library
Search Local Catalogue
eJournals

|

Login

Sprache auswählen

Simple Search

Search Local Catalogue > Simple Search

Ihre Mediensuche

Permalink

Permalink:

Permalink

Permanent link to this site:

Print result view

Define what should be printed

Current view

All results

Send results as email

Recipient's E-mail address Your name Subject Content

These titles may be interesting to you.

Link to the titles: https://wwwopen.dagstuhl.de/Permalink.aspx?searchhash=OCLC_09416173d7eda7d57ac03b3bf0bd309af6b27b3f

Captcha

CAPTCHA image

Enter the code shown above in the box below.

E-Mail

Recipient's E-mail address Your name Subject Content

Captcha

CAPTCHA image

Enter the code shown above in the box below.

Message the library

First name * Last name * E-mail-address * Phone Remark * Captcha

CAPTCHA image

Enter the code shown above in the box below.

Log into your user account.

You must be logged in to reserve items. Would you like to be redirected to the login page?

Log into your user account.

You must be logged in to reserve items. Would you like to be redirected to the login page?

Log into your user account.

You must be logged in to reserve items. Would you like to be redirected to the login page?

Select pickup branch

Choose the branch where you would like to pick up your record.

Branch

Log into your user account.

Provide your password!

Reserve

Enter your e-mail to place the reservation in OverDrive.

E-mail-address

Reserve

Filter further (advanced search)

search filter

Author

limit search to Author

(28)Lee, Euiwoong

(6)Manurangsi, Pasin

(4)Anand, Aditya -Ann Arbor-

(4)Cohen-Addad, Vincent

(4)Guruswami, Venkatesan

Display more Author-filters

Year

limit search to Year

(1)2026

(8)2025

(4)2024

(1)2023

(2)2022

Display more Year-filters

Publisher

limit search to Publisher

(2)Springer

(2)arXiv.org

Media group

limit search to Media group

(24)LIPIcs

(4)ARTICLE

search filter

Author

limit search to Author

(28)Lee, Euiwoong

(6)Manurangsi, Pasin

(4)Anand, Aditya -Ann Arbor-

(4)Cohen-Addad, Vincent

(4)Guruswami, Venkatesan

Display more Author-filters

Year

limit search to Year

(1)2026

(8)2025

(4)2024

(1)2023

(2)2022

Display more Year-filters

Publisher

limit search to Publisher

(2)Springer

(2)arXiv.org

Media group

limit search to Media group

(24)LIPIcs

(4)ARTICLE

Print Permalink Send results as email

Sort by ascending

1 2 3 next Turn to last page 28 record(s) records per page

search result

Cover von Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-Williamson

Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-Williamson

more...

Year: 2025

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

Cover von On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems

more...

Year: 2025

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

Cover von Facility Location on High-Dimensional Euclidean Spaces

Facility Location on High-Dimensional Euclidean Spaces

more...

Year: 2025

Parent work: 16th Innovations in Theoretical Computer Science Conference

Media group: LIPIcs

Cover von Improved Hardness for Cut, Interdiction, and Firefighter Problems

Improved Hardness for Cut, Interdiction, and Firefighter Problems

more...

Year: 2017

Parent work: 44th International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Cover von Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem

Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem

more...

Year: 2022

Parent work: 13th Innovations in Theoretical Computer Science Conference

Media group: LIPIcs

Cover von Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs

Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs

more...

Year: 2024

Parent work: 15th Innovations in Theoretical Computer Science Conference

Media group: LIPIcs

Cover von Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs

Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs

article

Search for this author more...

Year: 2023

Publisher: Cornell University, arXiv.org

Media group: ARTICLE

available at {0}available at some branchesavailableShow details

not availableShow details

Download For download from extern company - opens in new tab

loading

Cover von Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities

Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities

more...

Year: 2018

Parent work: 26th Annual European Symposium on Algorithms

Media group: LIPIcs

Cover von Understanding the Correlation Gap For Matchings

Understanding the Correlation Gap For Matchings

more...

Year: 2018

Parent work: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science

Media group: LIPIcs

Cover von Towards a Characterization of Approximation Resistance for Symmetric CSPs

Towards a Characterization of Approximation Resistance for Symmetric CSPs

more...

Year: 2015

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

Sort by ascending

1 2 3 next Turn to last page 28 record(s) records per page

Print Permalink Send results as email

OPEN V 11.1.0.0

No elements for display.

conference
hemodynamical flows
dongarra
thermodynamics
nanosystems
thermodynamically
sommer
somer
systems
tom
system architecture
symmetric cryptography
ai systems
thermodynamic
digital humanism
holger hermanns
being a researcher
31st annual symposium on combinatorial pattern matching
multiobjective optimization
user-aligned assessment of ai systems

Most search terms Search for conference Search for hemodynamical flows Search for dongarra Search for thermodynamics Search for nanosystems Search for thermodynamically Search for sommer Search for somer Search for systems Search for tom Search for system architecture Search for symmetric cryptography Search for ai systems Search for thermodynamic Search for digital humanism Search for holger hermanns Search for being a researcher Search for 31st annual symposium on combinatorial pattern matching Search for multiobjective optimization Search for user-aligned assessment of ai systems

Copyright 2025 by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH | Privacy Statement | Imprint