Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • for Model Checking: Completed‐Data Plots with Missing and Latent Data 2006-01-03 Paper A case study on the choice, interpretation and checking of multilevel...
    10 bytes (17 words) - 16:46, 27 February 2024
  • online knapsack problem: advice and randomization 2014-03-13 Paper Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking 2014-01-28 Paper...
    10 bytes (17 words) - 04:34, 9 December 2023
  • Branch-and-cut-and-price for multi-agent path finding 2022-06-22 Paper Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear...
    10 bytes (18 words) - 00:40, 10 December 2023
  • clustering problem on complete signed graphs 2021-09-15 Paper Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a...
    10 bytes (20 words) - 11:41, 11 December 2023
  • Decidable Extensions of Church’s Problem 2009-11-12 Paper Time-Bounded Verification 2009-10-22 Paper The Church Problem for Countable Ordinals 2009-06-30...
    10 bytes (16 words) - 00:32, 10 December 2023
  • schedules 1995-01-01 Paper A family of efficient regular arrays for algebraic path problem 1994-01-01 Paper A systolic generation of combinations 1989-01-01 Paper...
    10 bytes (18 words) - 02:44, 25 September 2023
  • undecidability results on weighted timed automata 2010-01-18 Paper Mu-calculus path checking 2009-12-18 Paper Measuring Permissivity in Finite Games 2009-10-22 Paper...
    10 bytes (16 words) - 03:56, 25 September 2023
  • 2005-04-25 Paper Multicolour Turán problems 2004-10-12 Paper A hypergraph extension of the bipartite Turán problem 2004-08-06 Paper On hypergraphs of girth...
    10 bytes (17 words) - 00:25, 11 December 2023
  • approach to the master surgical scheduling problem 2013-05-28 Paper Color-Coding Algorithms to the Balanced Path Problem: Computational Issues 2012-07-28 Paper...
    10 bytes (17 words) - 10:16, 11 December 2023
  • the maximal independent set problem 1986-01-01 Paper Scheduling transmissions in a network 1985-01-01 Paper Bounds on path connectivity 1984-01-01 Paper...
    10 bytes (16 words) - 22:07, 10 December 2023
  • Vacation 2018-09-06 Paper Scheduling a Rescue 2018-08-22 Paper Reversibility Checking for Markov Chains 2018-06-26 Paper Urn Models and Fibonacci Series 2018-06-24...
    10 bytes (16 words) - 12:19, 8 December 2023
  • 2014-12-18 Paper An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions...
    10 bytes (18 words) - 11:54, 11 December 2023
  • 2018-08-02 Paper Pattern logics and auxiliary relations 2018-04-23 Paper Path Logics for Querying Graphs: Combining Expressiveness and Efficiency 2018-04-23...
    10 bytes (19 words) - 01:39, 10 December 2023
  • Reactive Synthesis 2016-04-13 Paper Variations on the Stochastic Shortest Path Problem 2015-02-04 Paper Robust reachability in timed automata and games: a game-based...
    10 bytes (16 words) - 03:56, 25 September 2023
  • decomposition and its applications to the directed disjoint paths problem 2020-09-28 Paper Model-Checking on Ordered Structures 2020-09-11 Paper Automorphism groups...
    10 bytes (19 words) - 10:02, 9 December 2023
  • on three blow-ups of $\mathbb{P}^{3}$ 2019-08-15 Paper Availability‐based path selection and network vulnerability assessment 2018-05-23 Paper Linear and...
    10 bytes (16 words) - 20:10, 9 December 2023
  • Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm 1994-05-24 Paper The ``stable roommates problem with random preferences 1994-01-05...
    10 bytes (19 words) - 02:14, 10 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
  • 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
  • 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
View ( | ) (20 | 50 | 100 | 250 | 500)