The following pages link to Mirko Křivánek (Q1071506):
Displaying 49 items.
- (Q685485) (redirect page) (← links)
- (Q1262146) (redirect page) (← links)
- A lower bound for randomized list update algorithms (Q685486) (← links)
- A simple and relatively efficient triangulation of the n-cube (Q804290) (← links)
- Higher-dimensional Voronoi diagrams in linear expected time (Q804320) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems (Q1071507) (← links)
- Invariant sets of arcs in network flow problems (Q1071638) (← links)
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths (Q1072571) (← links)
- Some NP-complete problems for hypergraph degree sequences (Q1076694) (← links)
- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete (Q1077168) (← links)
- Quelques utilisations de la STRUCTION. (Some applications of STRUCTION) (Q1080863) (← links)
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
- Underlying graph and total length of optimal realizations of variable distance matrices (Q1095929) (← links)
- Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid (Q1097893) (← links)
- The complexity of ultrametric partitions on graphs (Q1098632) (← links)
- NP-hard problems in hierarchical-tree clustering (Q1102746) (← links)
- An improved algorithm for transitive closure on acyclic digraphs (Q1110330) (← links)
- Extremal theory and bipartite graph-tree Ramsey numbers (Q1112065) (← links)
- Ramanujan graphs (Q1112836) (← links)
- Graph isomorphism is in the low hierarchy (Q1116696) (← links)
- Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- Computing correct Delaunay triangulations (Q1179540) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Axioms and hulls (Q1202183) (← links)
- Shortest curves in planar regions with curved boundary (Q1210291) (← links)
- Geometric algorithms and combinatorial optimization (Q1210712) (← links)
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra (Q1262147) (← links)
- Kernel-type estimators of jump points and values of a regression function (Q1314468) (← links)
- Satisfiability of co-nested formulas (Q1323332) (← links)
- Toolpath generation for freeform surface models (Q1331422) (← links)
- Clustering, classification and image segmentation on the grid (Q2563647) (← links)
- (Q3359796) (← links)
- (Q3691419) (← links)
- (Q3696521) (← links)
- (Q3698098) (← links)
- An application of limited branching in clustering (Q3700867) (← links)
- (Q3703127) (← links)
- (Q3747722) (← links)
- (Q3774748) (← links)
- (Q3774971) (← links)
- (Q3802605) (← links)
- (Q3960874) (← links)
- (Q4273465) (← links)
- (Q4325228) (← links)
- (Q4836165) (← links)
