Simple Search

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

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

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

Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs

Year: 2018

Parent work: Technical Communications of the 33rd International Conference on Logic Programming

Media group: OASICS

A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs

Year: 2018

Parent work: 1st Symposium on Simplicity in Algorithms

Media group: OASICS

On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)

Year: 2017

Parent work: 42nd International Symposium on Mathematical Foundations of Computer Science

Media group: LIPIcs

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs

Year: 2017

Parent work: 42nd International Symposium on Mathematical Foundations of Computer Science

Media group: LIPIcs

Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All

Year: 2017

Parent work: 8th Innovations in Theoretical Computer Science Conference

Media group: LIPIcs

Simple and Near-Optimal Distributed Coloring for Sparse Graphs

Year: 2017

Parent work: 31st International Symposium on Distributed Computing

Media group: LIPIcs

Graphs in Biomedical Image Analysis, Computational Anatomy and Imaging Genetics

First International Workshop, GRAIL 2017, 6th International Workshop, MFCA 2017, and Third International Workshop, MICGen 2017, Held in Conjunction with MICCAI 2017, Québec City, QC, Canada, September 10-14, 2017, Proceedings

Year: 2017

Publisher: Heidelberg, Springer

Series: Lecture notes in computer science; 10551

Media group: MONOGRAPHIE

The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime

Year: 2017

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces

Year: 2017

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs

Year: 2017

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

OPEN V 11.1.0.0

Simple Search

Author

Year

Publisher

Media group

Author

Year

Publisher

Media group

Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs

A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs

On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs

Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All

Simple and Near-Optimal Distributed Coloring for Sparse Graphs

Graphs in Biomedical Image Analysis, Computational Anatomy and Imaging Genetics

The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime

Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces

A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs

Simple Search

search result

Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs

A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs

On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs

Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All

Simple and Near-Optimal Distributed Coloring for Sparse Graphs

Graphs in Biomedical Image Analysis, Computational Anatomy and Imaging Genetics

The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime

Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces

A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs