Skip to Main Content (Press Enter)
×
Home
Degrees
Courses
Jobs
People
Outputs
Organizations
Third Mission
Expertise & Skills
IT
EN
☰
|
UNIFIND
uniss.it
IT
EN
×
Home
Degrees
Courses
Jobs
People
Outputs
Organizations
Third Mission
Expertise & Skills
☰
Outputs
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS
Series
Identifier:
E212253
ISSN:
1868-8969
Overview
Overview
Outputs (17)
Clear
Sort by Outputs:
ascendant
decrescent
A novel algorithm for the all-best-swap-edge problem on tree spanners
Conference Paper
Almost optimal algorithms for diameter-optimally augmenting trees
Conference Paper
An improved algorithm for computing all the best swap edges of a tree spanner
Conference Paper
Applying Machine Learning Techniques to ASP Solving
Conference Paper
Applying machine learning techniques to ASP solving
Conference Paper
Compact and Fast Sensitivity Oracles for Single-Source Distances
Conference Paper
Cutting bamboo down to size
Conference Paper
Efficient oracles and routing schemes for replacement paths
Conference Paper
Fair tree connection games with topology-dependent edge cost
Conference Paper
Multiple-edge-fault-tolerant approximate shortest-path trees
Conference Paper
Near-optimal deterministic single-source distance sensitivity oracles
Conference Paper
New algorithms for Steiner tree reoptimization
Conference Paper
On the PSPACE - Completeness of peg duotaire and other peg-jumping games
Conference Paper
On the complexity of two dots for narrow boards and few colors
Conference Paper
On the tree conjecture for the network creation game
Conference Paper
Space-Efficient Fault-Tolerant Diameter Oracles
Conference Paper
Topological influence and locality in swap schelling games
Conference Paper
No Results Found
«
‹
{pageNumber}
›
»
{startItem} - {endItem} of {itemsNumber}
5 per page
10 per page
30 per page
view all
