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

A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs

Year: 2023

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar

Year: 2023

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

Media group: LIPIcs

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs

Year: 2023

Parent work: 39th International Symposium on Computational Geometry

Media group: LIPIcs

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs

Year: 2022

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

Media group: LIPIcs

Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion

Year: 2021

Parent work: 32nd International Symposium on Algorithms and Computation

Media group: LIPIcs

All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error

Year: 2021

Parent work: 29th Annual European Symposium on Algorithms

Media group: LIPIcs

Bias in Knowledge Graphs - An Empirical Study with Movie Recommendation and Different Language Editions of DBpedia

Year: 2021

Parent work: 3rd Conference on Language, Data and Knowledge

Media group: OASICS

Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs

Author: Yu, Huacheng

Year: 2021

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

Media group: LIPIcs

Almost-Linear-Time Weighted ?_p-Norm Solvers in Slightly Dense Graphs via Sparsification

Year: 2021

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

Media group: LIPIcs

An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs

Year: 2021

Parent work: 38th International Symposium on Theoretical Aspects of Computer Science

Media group: LIPIcs

OPEN V 11.1.0.0

Simple Search

Author

Year

Publisher

Media group

Author

Year

Publisher

Media group

A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs

Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs

Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion

All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error

Bias in Knowledge Graphs - An Empirical Study with Movie Recommendation and Different Language Editions of DBpedia

Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs

Almost-Linear-Time Weighted ?_p-Norm Solvers in Slightly Dense Graphs via Sparsification

An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs

Simple Search

search result

A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs

Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs

Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion

All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error

Bias in Knowledge Graphs - An Empirical Study with Movie Recommendation and Different Language Editions of DBpedia

Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs

Almost-Linear-Time Weighted ?_p-Norm Solvers in Slightly Dense Graphs via Sparsification

An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs