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

Polymorphic Cycle Basis in a Sequence of Graphs to Analyze the Structural Evolution of a Molecular Dynamic Trajectory

Year: 2025

Parent work: 23rd International Symposium on Experimental Algorithms

Media group: LIPIcs

(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs

Year: 2025

Parent work: 52nd International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs

Year: 2025

Parent work: 52nd International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems

Improving the Shrink-And-Bifurcate Technique

Year: 2025

Parent work: 41st International Symposium on Computational Geometry

Media group: LIPIcs

Better Late, Then? The Hardness of Choosing Delays to Meet Passenger Demands in Temporal Graphs

Year: 2025

Parent work: 4th Symposium on Algorithmic Foundations of Dynamic Networks

Media group: LIPIcs

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols

Year: 2025

Parent work: 28th International Conference on Principles of Distributed Systems

Media group: LIPIcs

$Cover von Uniform Polynomial Kernel for Deletion to K_{2,p} Minor-Free Graphs$

Uniform Polynomial Kernel for Deletion to K_{2,p} Minor-Free Graphs

Year: 2024

Parent work: 35th International Symposium on Algorithms and Computation

Media group: LIPIcs

Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs

Year: 2024

Parent work: 41st International Symposium on Theoretical Aspects of Computer Science

Media group: LIPIcs

Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs

Year: 2023

Parent work: 34th International Symposium on Algorithms and Computation

Media group: LIPIcs

A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs

Year: 2023

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

Polymorphic Cycle Basis in a Sequence of Graphs to Analyze the Structural Evolution of a Molecular Dynamic Trajectory

(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems

Better Late, Then? The Hardness of Choosing Delays to Meet Passenger Demands in Temporal Graphs

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols

Uniform Polynomial Kernel for Deletion to K_{2,p} Minor-Free Graphs

Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs

Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs

A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs

Simple Search

search result

Polymorphic Cycle Basis in a Sequence of Graphs to Analyze the Structural Evolution of a Molecular Dynamic Trajectory

(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems

Better Late, Then? The Hardness of Choosing Delays to Meet Passenger Demands in Temporal Graphs

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols

Uniform Polynomial Kernel for Deletion to K_{2,p} Minor-Free Graphs

Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs

Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs

A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs