Marek Kubale

1.2k total citations
54 papers, 630 citations indexed

About

Marek Kubale is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, Marek Kubale has authored 54 papers receiving a total of 630 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computational Theory and Mathematics, 19 papers in Computer Networks and Communications and 19 papers in Industrial and Manufacturing Engineering. Recurrent topics in Marek Kubale's work include Advanced Graph Theory Research (26 papers), Graph Labeling and Dimension Problems (17 papers) and Scheduling and Optimization Algorithms (17 papers). Marek Kubale is often cited by papers focused on Advanced Graph Theory Research (26 papers), Graph Labeling and Dimension Problems (17 papers) and Scheduling and Optimization Algorithms (17 papers). Marek Kubale collaborates with scholars based in Poland, Slovakia and United States. Marek Kubale's co-authors include Krzysztof Giaro, Henryk Krawczyk, Jacek Dąbrowski, Dariusz Dereniowski and Stanisław Radziszowski and has published in prestigious journals such as SHILAP Revista de lepidopterología, Communications of the ACM and European Journal of Operational Research.

In The Last Decade

Marek Kubale

48 papers receiving 570 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Marek Kubale Poland	14	302	254	251	131	113	54	630
Tommy R. Jensen Germany	7	481 1.6×	53 0.2×	143 0.6×	29 0.2×	148 1.3×	20	627
Bjarne Toft Denmark	12	610 2.0×	36 0.1×	117 0.5×	32 0.2×	187 1.7×	33	762
Jan Arne Telle Norway	16	720 2.4×	29 0.1×	343 1.4×	24 0.2×	71 0.6×	69	864
Shlomi Rubinstein Israel	10	166 0.5×	102 0.4×	108 0.4×	24 0.2×	30 0.3×	14	314
Zs. Tuza Hungary	19	868 2.9×	89 0.4×	149 0.6×	27 0.2×	169 1.5×	65	1.1k
Imrich Vrt’o Slovakia	12	270 0.9×	89 0.4×	149 0.6×	8 0.1×	142 1.3×	60	437
Zeev Nutov Israel	17	639 2.1×	61 0.2×	517 2.1×	12 0.1×	114 1.0×	93	801
Toshihiro Fujito Japan	10	287 1.0×	50 0.2×	193 0.8×	25 0.2×	37 0.3×	25	386
Eric Mendelsohn Canada	16	200 0.7×	21 0.1×	47 0.2×	64 0.5×	407 3.6×	59	620
S. Poljak Czechia	10	311 1.0×	48 0.2×	106 0.4×	14 0.1×	77 0.7×	21	474

Countries citing papers authored by Marek Kubale

Since Specialization

Citations

This map shows the geographic impact of Marek Kubale'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 Marek Kubale with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marek Kubale more than expected).

Fields of papers citing papers by Marek Kubale

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marek Kubale. 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 Marek Kubale. The network helps show where Marek Kubale may publish in the future.

Co-authorship network of co-authors of Marek Kubale

This figure shows the co-authorship network connecting the top 25 collaborators of Marek Kubale. A scholar is included among the top collaborators of Marek Kubale 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 Marek Kubale. Marek Kubale is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Kubale, Marek, et al.. (2022). Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms. Artificial Intelligence. 309. 103711–103711. 3 indexed citations

2.

Kubale, Marek, et al.. (2019). Better polynomial algorithms for scheduling unit-length jobswith bipartite incompatibility graphs on uniform machines. Bulletin of the Polish Academy of Sciences Technical Sciences. 31–36. 1 indexed citations

3.

Kubale, Marek, et al.. (2017). Equitable Colorings Of Corona Multiproducts Of Graphs. SHILAP Revista de lepidopterología.

4.

Kubale, Marek, et al.. (2015). On bipartization of cubic graphs by removal of an independent set. Discrete Applied Mathematics. 209. 115–121. 2 indexed citations

5.

Kubale, Marek, et al.. (2014). Some lower bounds on the Shannon capacity. 22. 2 indexed citations

6.

Kubale, Marek, et al.. (2011). A note on Shannon capacity for invariant and evolving channels. 19. 19–29. 1 indexed citations

7.

Kubale, Marek, et al.. (2010). Rearrangeability in multicast clos networks is np-complete. 183–186. 2 indexed citations

8.

Kubale, Marek, et al.. (2009). A new optimal algorithm for a time-dependent scheduling problem. Control and Cybernetics. 38(3). 713–721. 16 indexed citations

9.

Dąbrowski, Jacek & Marek Kubale. (2006). Parallel tabu search for graph coloring problem. 87–95.

10.

Kubale, Marek, et al.. (2005). The Complexity of Equitable Vertex Coloring of Graphs. 13. 95–106. 12 indexed citations

11.

Giaro, Krzysztof & Marek Kubale. (2004). Compact scheduling of zero–one time operations in multi-stage systems. Discrete Applied Mathematics. 145(1). 95–103. 31 indexed citations

12.

Giaro, Krzysztof, et al.. (2002). Complexity results on open shop scheduling to minimize total cost of operations.. 3. 84–91. 1 indexed citations

13.

Kubale, Marek, et al.. (2001). Scheduling unit execution time tasks with symmetric time-lags. 9. 45–51. 1 indexed citations

14.

Kubale, Marek, et al.. (2001). A survey of hard-to-color graphs for off-line and on-line model of vertex coloring. 9. 7–17. 1 indexed citations

15.

Kubale, Marek, et al.. (2001). The smallest hard-to-color graph for algorithm DSATUR. Discrete Mathematics. 236(1-3). 151–165. 5 indexed citations

16.

Kubale, Marek, et al.. (1999). The smallest hard-to-color graphs for the classical, total and strong colorings of vertices. Control and Cybernetics. 28(2). 355–365.

17.

Kubale, Marek. (1997). Open shop problem with zero-one time operations and integer release date/deadline intervals. Discrete Applied Mathematics. 76(1-3). 213–223. 3 indexed citations

18.

Kubale, Marek. (1992). Some results concerning the complexity of restricted colorings of graphs. Discrete Applied Mathematics. 36(1). 35–46. 22 indexed citations

19.

Kubale, Marek, et al.. (1983). Computer Experiences with Implicit Enumeration Algorithms for Graph Coloring.. 167–176. 2 indexed citations

20.

Kubale, Marek. (1982). Comments on "Decomposition of Permutation Networks". IEEE Transactions on Computers. C-31(3). 265–265. 9 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.

Explore authors with similar magnitude of impact