This map shows the geographic impact of Milan Vlach'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 Milan Vlach with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Milan Vlach more than expected).
This network shows the impact of papers produced by Milan Vlach. 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 Milan Vlach. The network helps show where Milan Vlach may publish in the future.
Co-authorship network of co-authors of Milan Vlach
This figure shows the co-authorship network connecting the top 25 collaborators of Milan Vlach.
A scholar is included among the top collaborators of Milan Vlach 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 Milan Vlach. Milan Vlach 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.
Ramı́k, Jaroslav & Milan Vlach. (2013). Measuring consistency and inconsistency of pair comparison systems. Kybernetika. 49(3). 465–486.3 indexed citations
2.
Vlach, Milan, et al.. (2006). POWER ANALYSIS OF VOTING BY COUNT AND ACCOUNT. Kybernetika. 42(4). 483–493.2 indexed citations
3.
Mareš, Milan & Milan Vlach. (2004). FUZZY CLASSES OF COOPERATIVE GAMES WITH TRANSFERABLE UTILITY. Scientiae mathematicae Japonicae. 60(2). 269–278.12 indexed citations
4.
Mareš, Milan & Milan Vlach. (2003). Alternative model of fuzzy NTU coalitional game. Kybernetika. 39(3). 265–274.
Ramı́k, Jaroslav & Milan Vlach. (2001). Generalized Concavity as a Basis for Optimization and Decision Analysis. JAIST Repository. 2001.2 indexed citations
7.
Sung, Shao Chin & Milan Vlach. (2000). A procedure for competitive fair division. JAIST Repository. 2000. 1–5.1 indexed citations
Vlach, Milan. (1998). Single machine scheduling under fuzziness. JAIST Repository. 98. 1–26.4 indexed citations
11.
Vlach, Milan, et al.. (1998). Minimizing total completion time in a two-machine no-idle flowshop. JAIST Repository. 98. 1–23.2 indexed citations
12.
Ramı́k, Jaroslav & Milan Vlach. (1997). Strong pareto optimality of compromise decisions in multi-criteria analysis. JAIST Repository. 97. 1–14.1 indexed citations
13.
Tanaka, Keisuke & Milan Vlach. (1997). Single Machine Scheduling to Minimize the Maximum Lateness with Both Specific and Generalized Due Dates. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 557–563.10 indexed citations
14.
Tanaka, Keisuke & Milan Vlach. (1997). Single Machine Scheduling to Minimize the Maximum Lateness with Both Specific and Generalized Due Dates (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 80(3). 557–563.5 indexed citations
15.
Vlach, Milan, et al.. (1996). Improved algorithms for single machine scheduling with fuzzy due dates. Kagoshima Kenritsu Tanki Daigaku Chiiki Kenkyūjo kenkyū nenpō. 96. 1–10.
16.
Vlach, Milan, et al.. (1995). Minimizing the range of lateness on a single machine under generalized due dates. Kagoshima Kenritsu Tanki Daigaku Chiiki Kenkyūjo kenkyū nenpō. 95. 1–14.1 indexed citations
Vlach, Milan. (1977). A note on separation by linear mappings. Commentationes Mathematicae Universitatis Carolinae. 18(1). 167–168.1 indexed citations
19.
Vlach, Milan. (1971). A separation theorem for finite families. Commentationes Mathematicae Universitatis Carolinae. 12(4). 655–660.2 indexed citations
20.
Vlach, Milan. (1970). On necessary conditions of optimality in linear spaces. Commentationes Mathematicae Universitatis Carolinae. 11(3). 501–513.8 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.