The following pages link to Vladimír Lacko (Q187117):
Displaying 50 items.
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- Boolean functions and their applications in cryptography (Q345716) (← links)
- Distributed graph algorithms for computer networks (Q355058) (← links)
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem (Q415364) (← links)
- On quasigroups with few associative triples (Q420637) (← links)
- Some lattice attacks on DSA and ECDSA (Q429782) (← links)
- Hybrid Bellman-Ford-Dijkstra algorithm (Q511150) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Least-squares approximations in geometric buildup for solving distance geometry problems (Q637550) (← links)
- Design and analysis of approximation algorithms (Q648055) (← links)
- Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
- Hamiltonian cycle problem and Markov chains. (Q663172) (← links)
- Regular augmentation of planar graphs (Q747622) (← links)
- The spectra of a graph obtained from copies of a generalized Bethe tree (Q861010) (← links)
- On trees with exactly one characteristic element (Q869893) (← links)
- Eigenvalues and forbidden subgraphs. I. (Q869937) (← links)
- Domination in partitioned graphs with minimum degree two (Q870974) (← links)
- Cospectral graphs and the generalized adjacency matrix (Q876300) (← links)
- Feedback numbers of Kautz digraphs (Q879335) (← links)
- Concave programming for minimizing the zero-norm over polyhedral sets (Q989849) (← links)
- A note on a new variant of Murty's ranking assignments algorithm (Q1416101) (← links)
- Finding even subgraphs even faster (Q1671994) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Morphing Schnyder drawings of planar triangulations (Q1739203) (← links)
- On the edge-length ratio of outerplanar graphs (Q1740698) (← links)
- Nontrivial discontinuities of the Golovach functions for trees (Q1759468) (← links)
- Arbitrarily large jumps of the Golovach function for trees (Q1759500) (← links)
- Minimax trees in linear time with applications (Q1761500) (← links)
- The kidney exchange problem: how hard is it to find a donor? (Q1931639) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- On the tree conjecture for the network creation game (Q1987511) (← links)
- Fractional \(f\)-edge cover chromatic index of graphs (Q2014721) (← links)
- Box-total dual integrality, box-integrality, and equimodular matrices (Q2039243) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Two-to-one functions from Galois extensions (Q2065785) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- On the graph Laplacian and the rankability of data (Q2174433) (← links)
- Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number (Q2185816) (← links)
- Theory and methods of Euclidian combinatorial optimization: current status and prospects (Q2215570) (← links)
- New polyhedral and algorithmic results on greedoids (Q2220660) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- Pauli half spinning and elliptic curve based information confidentiality mechanism (Q2239780) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- All solutions to the immobilizer problem (Q2341295) (← links)
