Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • and Related Problems 2009-02-17 Paper https://portal.mardi4nfdi.de/entity/Q3602883 2009-02-12 Paper On the all-pairs-shortest-path problem in unweighted...
    10 bytes (16 words) - 17:10, 12 December 2023
  • Satisfiability Problem: Simple Algorithms and Inapproximability Bounds 2017-06-28 Paper On the optimality of Bellman-Ford-Moore shortest path algorithm 2016-04-13...
    10 bytes (17 words) - 17:56, 9 December 2023
  • bound method when solving the knapsack problem 1985-01-01 Paper Some algorithms for solving the covering problem, and their experimental study on a computer...
    10 bytes (18 words) - 10:46, 6 October 2023
  • efficient first-order model-checking 2011-02-18 Paper https://portal.mardi4nfdi.de/entity/Q3077955 2011-02-18 Paper Constrained-path labellings on graphs of...
    10 bytes (17 words) - 10:24, 8 December 2023
  • application in the problem of compression of an infinite well 2015-11-26 Paper Simultaneous identification of bi-directional paths in closed-loop systems...
    10 bytes (17 words) - 14:18, 10 December 2023
  • Spanning Tree Congestion Problem 2013-11-28 Paper The path-distance-width of hypercubes 2013-11-11 Paper Base Location Problems for Base-Monotone Regions...
    10 bytes (17 words) - 19:18, 6 October 2023
  • between the maximum multiplicity and path cover number for tree-like graphs 2005-10-17 Paper The copositive completion problem 2005-10-10 Paper Spectral graph...
    10 bytes (17 words) - 13:59, 7 December 2023
  • of \(\mathrm{ECTL}^*\) with local tree constraints 2017-10-20 Paper Path Checking for MTL and TPTL over Data Words 2017-10-12 Paper https://portal.mardi4nfdi...
    10 bytes (17 words) - 10:06, 6 October 2023
  • and metaquerying in \texttt{OWL 2 QL} 2021-11-02 Paper The what-to-ask problem for ontology-based peers 2020-06-04 Paper https://portal.mardi4nfdi.de/entity/Q5282975...
    10 bytes (17 words) - 14:35, 11 December 2023
  • Undirected Two Paths Problem 1980-01-01 Paper Strong linear orderings of a directed network 1979-01-01 Paper A fast equivalence-checking algorithm for circular...
    10 bytes (16 words) - 09:02, 13 December 2023
  • constraints 2010-09-15 Paper Model checking memoryful linear-time logics over one-counter automata 2010-05-27 Paper When Model-Checking Freeze LTL over Counter Machines...
    10 bytes (18 words) - 07:38, 9 December 2023
  • Paper A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM 2004-10-06 Paper Self-stabilizing multicast protocols for ad hoc networks...
    10 bytes (18 words) - 12:06, 9 December 2023
  • programs 2018-11-15 Paper Left-eigenvectors are certificates of the Orbit problem 2018-10-23 Paper Symbolic reachability analysis of FIFO-channel systems...
    10 bytes (16 words) - 03:52, 25 September 2023
  • 2021-07-28 Paper On structural parameterizations of the edge disjoint paths problem 2021-06-11 Paper Towards a polynomial kernel for directed feedback vertex...
    10 bytes (19 words) - 00:03, 10 December 2023
  • Dispersion Problem 2007-09-10 Paper On Spanners of Geometric Graphs 2007-09-07 Paper Schematisation of Tree Drawings 2007-08-28 Paper Path Simplification...
    10 bytes (16 words) - 18:03, 11 December 2023
  • Complexity of Locally Checkable Problems on Paths is Decidable 2021-01-20 Paper An Automatic Speedup Theorem for Distributed Problems 2021-01-20 Paper A Sharp...
    10 bytes (18 words) - 08:05, 13 December 2023
  • Publication Date of Publication Type Foundations of graph path query languages. Course notes for the reasoning web summer school 2021 2023-08-03 Paper...
    10 bytes (16 words) - 12:19, 24 September 2023
  • The homogeneous broadcast problem in narrow and wide strips. I: Algorithms 2019-05-21 Paper The homogeneous broadcast problem in narrow and wide strips...
    10 bytes (21 words) - 15:15, 10 December 2023
  • on the largest empty rectangle problem 1988-01-01 Paper The orthogonal convex skull problem 1988-01-01 Paper Hole Problems for Rectangles in the Plane 1988-01-01...
    10 bytes (17 words) - 19:27, 9 December 2023
  • SPL Model Checking Using Parity Games with Variability 2022-10-13 Paper Off-the-shelf automated analysis of liveness properties for just paths (extended...
    10 bytes (20 words) - 19:33, 12 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)