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

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs

Year: 2016

Parent work: 32nd International Symposium on Computational Geometry

Media group: LIPIcs

Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs

Year: 2016

Parent work: 33rd Symposium on Theoretical Aspects of Computer Science

Media group: LIPIcs

Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees

Year: 2015

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk)

Year: 2015

Parent work: 26th International Conference on Rewriting Techniques and Applications

Media group: LIPIcs

New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings

Year: 2014

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

Media group: LIPIcs

Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace

Year: 2012

Parent work: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)

Media group: ARTICLE

Designing q-Unique DNA Sequences with Integer Linear Programs and Euler Tours in De Bruijn Graphs

Year: 2012

Parent work: German Conference on Bioinformatics 2012

Media group: ARTICLE

Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid

Year: 2012

Parent work: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)

Media group: ARTICLE

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs

Year: 2009

Parent work: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science

Media group: ARTICLE

Minimum s-t cut in undirected planar graphs when the source and the sink are close

Year: 2011

Parent work: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)

Media group: ARTICLE

OPEN V 11.1.0.0

Simple Search

Author

Year

Publisher

Media group

Author

Year

Publisher

Media group

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs

Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs

Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees

Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk)

New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings

Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace

Designing q-Unique DNA Sequences with Integer Linear Programs and Euler Tours in De Bruijn Graphs

Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs

Minimum s-t cut in undirected planar graphs when the source and the sink are close

Simple Search

search result

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs

Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs

Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees

Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk)

New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings

Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace

Designing q-Unique DNA Sequences with Integer Linear Programs and Euler Tours in De Bruijn Graphs

Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs

Minimum s-t cut in undirected planar graphs when the source and the sink are close