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

Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network

Year: 2018

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

Media group: LIPIcs

The b-Matching Problem in Distance-Hereditary Graphs and Beyond

Year: 2018

Parent work: 29th International Symposium on Algorithms and Computation

Media group: LIPIcs

Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs

Year: 2018

Parent work: 29th International Symposium on Algorithms and Computation

Media group: LIPIcs

Data-Compression for Parametrized Counting Problems on Sparse Graphs

Year: 2018

Parent work: 29th International Symposium on Algorithms and Computation

Media group: LIPIcs

Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm

Year: 2018

Parent work: 29th International Symposium on Algorithms and Computation

Media group: LIPIcs

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs

Year: 2018

Parent work: 29th International Symposium on Algorithms and Computation

Media group: LIPIcs

Approximate Matchings in Massive Graphs via Local Structure (Invited Talk)

Year: 2018

Parent work: 29th International Symposium on Algorithms and Computation

Media group: LIPIcs

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Year: 2018

Publisher: Cornell University, arXiv.org

Media group: ARTICLE

Graphs in Biomedical Image Analysis and Integrating Medical Imaging and Non-Imaging Modalities

Second International Workshop, GRAIL 2018 and First International Workshop, Beyond MIC 2018, Held in Conjunction with MICCAI 2018, Granada, Spain, September 20, 2018, Proceedings

Year: 2018

Publisher: Heidelberg, Springer

Series: Lecture notes in computer science; 11044

Media group: MONOGRAPHIE

Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames

Year: 2018

Parent work: 43rd International Symposium on Mathematical Foundations of Computer Science

Media group: LIPIcs

OPEN V 11.1.0.0

Simple Search

Author

Year

Publisher

Media group

Author

Year

Publisher

Media group

Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network

The b-Matching Problem in Distance-Hereditary Graphs and Beyond

Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs

Data-Compression for Parametrized Counting Problems on Sparse Graphs

Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs

Approximate Matchings in Massive Graphs via Local Structure (Invited Talk)

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Graphs in Biomedical Image Analysis and Integrating Medical Imaging and Non-Imaging Modalities

Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames

Simple Search

search result

Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network

The b-Matching Problem in Distance-Hereditary Graphs and Beyond

Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs

Data-Compression for Parametrized Counting Problems on Sparse Graphs

Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs

Approximate Matchings in Massive Graphs via Local Structure (Invited Talk)

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Graphs in Biomedical Image Analysis and Integrating Medical Imaging and Non-Imaging Modalities

Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames