The following pages link to Vladimír Lacko (Q187117):
Displaying 32 items.
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- A faster parallel connectivity algorithm on cographs (Q2371145) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- Continuous nonlinear optimization for engineering applications in GAMS technology (Q2397259) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- On the mean number of encryptions for tree-based broadcast encryption schemes (Q2458926) (← links)
- On the minimum load coloring problem (Q2466019) (← links)
- APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\) (Q2467333) (← links)
- A spectral condition for odd cycles in graphs (Q2477528) (← links)
- Regularity and the generalized adjacency spectra of graphs (Q2496664) (← links)
- On the commutativity of antiblocker diagrams under lift-and-project operators (Q2500533) (← links)
- On optimum summable graphs (Q2508410) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
- On spanning disjoint paths in line graphs (Q2637723) (← links)
- On the chromaticity of quasi linear hypergraphs (Q2637737) (← links)
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems (Q2642409) (← links)
- On construction and (non)existence of \(c\)-(almost) perfect nonlinear functions (Q2662058) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Persistency in the Traveling Salesman Problem on Halin graphs (Q2725186) (← links)
- Balanced problems on graphs with categorization of edges (Q4458967) (← links)
- (Q4547477) (← links)
- (Q5389837) (← links)
- Fully dynamic arboricity maintenance (Q5918831) (← links)
- Persistency in combinatorial optimization problems on matroids (Q5936456) (← links)
- Efficiency and stability in a discrete model of country formation (Q5959044) (← links)
- Internet security applications of the Munn rings (Q5962333) (← links)
- Properties of certain semigroups and their potential as platforms for cryptosystems (Q5962339) (← links)
- Second-order symmetric duality for multiple objectives nonlinear programming under generalizations of cone-preinvexity functions (Q6159291) (← links)
