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

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees

Year: 2020

Parent work: 31st International Symposium on Algorithms and Computation

Media group: LIPIcs

Uncertainty for Safe Utilization of Machine Learning in Medical Imaging, and Graphs in Biomedical Image Analysis

Second International Workshop, UNSURE 2020, and Third International Workshop, GRAIL 2020, Held in Conjunction with MICCAI 2020, Lima, Peru, October 8, 2020, Proceedings

Year: 2020

Publisher: Heidelberg, Springer

Series: Lecture notes in computer science; 12443

Media group: MONOGRAPHIE

Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs

Year: 2020

Parent work: 45th International Symposium on Mathematical Foundations of Computer Science

Media group: LIPIcs

Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs

Year: 2020

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors

Year: 2020

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

Media group: LIPIcs

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs

Year: 2020

Parent work: 17th Scandinavian Symposium and Workshops on Algorithm Theory

Media group: LIPIcs

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Year: 2019

Parent work: 27th Annual European Symposium on Algorithms

Media group: LIPIcs

Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs

Year: 2019

Parent work: 30th Annual Symposium on Combinatorial Pattern Matching

Media group: LIPIcs

On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs

Year: 2019

Parent work: 13th International Symposium on Parameterized and Exact Computation

Media group: LIPIcs

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width

Year: 2018

Parent work: 35th 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

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees

Uncertainty for Safe Utilization of Machine Learning in Medical Imaging, and Graphs in Biomedical Image Analysis

Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs

Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs

d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs

On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width

Simple Search

search result

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees

Uncertainty for Safe Utilization of Machine Learning in Medical Imaging, and Graphs in Biomedical Image Analysis

Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs

Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs

d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs

On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width