Countries citing papers authored by Ladislav Lukšan
Since
Specialization
Citations
This map shows the geographic impact of Ladislav Lukšan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ladislav Lukšan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ladislav Lukšan more than expected).
This network shows the impact of papers produced by Ladislav Lukšan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ladislav Lukšan. The network helps show where Ladislav Lukšan may publish in the future.
Co-authorship network of co-authors of Ladislav Lukšan
This figure shows the co-authorship network connecting the top 25 collaborators of Ladislav Lukšan.
A scholar is included among the top collaborators of Ladislav Lukšan based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Ladislav Lukšan. Ladislav Lukšan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Lukšan, Ladislav & Jan Vlček. (2013). RECURSIVE FORM OF GENERAL LIMITED MEMORY VARIABLE METRIC METHODS. Kybernetika. 49(2). 224–235.1 indexed citations
2.
Lukšan, Ladislav, et al.. (2010). Primal interior point method for minimization of generalized minimax functions. Kybernetika. 46(4). 697–721.2 indexed citations
3.
Lukšan, Ladislav, et al.. (2009). Primal interior-point method for large sparse minimax optimization. Kybernetika. 45(5). 841–864.8 indexed citations
4.
Lukšan, Ladislav, et al.. (2009). Algorithm 896. ACM Transactions on Mathematical Software. 36(3). 1–29.8 indexed citations
Lukšan, Ladislav. (1985). A compact variable metric algorithm for linearly constrained nonlinear minimax approximation. Kybernetika. 21(6). 405–427.1 indexed citations
15.
Lukšan, Ladislav. (1985). An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation. Kybernetika. 21(1). 22–40.5 indexed citations
16.
Lukšan, Ladislav. (1985). Variable metric methods for a class of extended conic functions. Kybernetika. 21(2). 96–107.1 indexed citations
17.
Lukšan, Ladislav. (1984). Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation. Kybernetika. 20(6). 445–457.15 indexed citations
18.
Lukšan, Ladislav. (1982). Quasi-Newton methods without projections for linearly constrained minimization. Kybernetika. 18(4). 307–319.2 indexed citations
19.
Lukšan, Ladislav. (1982). Quasi-Newton methods without projections for unconstrained minimization. Kybernetika. 18(4). 290–306.2 indexed citations
20.
Lukšan, Ladislav. (1982). Variable metric method with limited storage for large-scale unconstrained minimization.. Kybernetika. 18. 517–528.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.