Search

Your search keyword '"Mertzios, George B."' showing total 400 results

Search Constraints

Start Over You searched for: Author "Mertzios, George B." Remove constraint Author: "Mertzios, George B."
400 results on '"Mertzios, George B."'

Search Results

1. NP-Completeness of the Combinatorial Distance Matrix Realisation Problem

2. On the existence of $\delta$-temporal cliques in random simple temporal graphs

Catalog

Books, media, physical & digital resources

3. Realizing temporal transportation trees

4. Payment Scheduling in the Interval Debt Model

5. The Threshold of Existence of -Temporal Cliques in Random Simple Temporal Graphs

7. Graphs with minimum fractional domatic number

8. Realizing temporal graphs from fastest travel times

9. The Complexity of Temporal Vertex Cover in Small-Degree Graphs

12. The complexity of computing optimum labelings for temporal connectivity

13. The Complexity of Growing a Graph

14. Interference-free Walks in Time: Temporally Disjoint Paths

15. The Complexity of Transitively Orienting Temporal Graphs

16. Payment Scheduling in the Interval Debt Model

19. Equitable Scheduling on a Single Machine

20. Matching in Stochastically Evolving Graphs

21. Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

23. Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems.

24. Linear Programming Complementation

25. Computing Maximum Matchings in Temporal Graphs

26. How fast can we reach a target vertex in stochastic temporal graphs?

27. The Complexity of Growing a Graph

29. Sliding Window Temporal Graph Coloring

30. Deleting edges to restrict the size of an epidemic in temporal networks

31. The temporal explorer who returns to the base

32. Lower and Upper Bound for Computing the Size of All Second Neighbourhoods

33. Temporal Vertex Cover with a Sliding Time Window

34. Searching for Maximum Out-Degree Vertices in Tournaments

35. Kernelization Lower Bounds for Finding Constant-Size Subgraphs

36. A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs

37. Binary Search in Graphs Revisited

38. When can Graph Hyperbolicity be computed in Linear Time?

39. The Power of Data Reduction for Matching

40. The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs

41. On the Complexity of Weighted Greedy Matchings

42. Graph Editing to a Given Degree Sequence

46. The Complexity of Growing a Graph

47. Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds

48. Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs

49. The complexity of optimal design of temporally connected graphs

50. Temporal Network Optimization Subject to Connectivity Constraints