Marcin Anholcer
Marcin Anholcer
Associate Professor, Poznań University of Economics and Business
Verified email at ue.poznan.pl
Title
Cited by
Cited by
Year
Badania operacyjne
W Sikora, M Anholcer, H Gaspars-Wieloch, M Godlewski, J Marcinkowski, ...
Polskie Wydawnictwo Ekonomiczne, 2008
1012008
A new upper bound for the total vertex irregularity strength of graphs
M Anholcer, M Kalkowski, J Przybyło
Discrete Mathematics 309 (21), 6316-6317, 2009
782009
Irregular labelings of circulant graphs
M Anholcer, C Palmer
Discrete Mathematics 312 (23), 3461-3466, 2012
402012
Distance magic labeling and two products of graphs
M Anholcer, S Cichacz, I Peterin, A Tepeh
Graphs and Combinatorics 31 (5), 1125-1136, 2015
202015
A simplified implementation of the least squares solution for pairwise comparisons matrices
M Anholcer, V Babiy, S Bozóki, WW Koczkodaj
Central European Journal of Operations Research 19 (4), 439-444, 2011
172011
Group Distance Magic Labeling of Direct Product of Graphs
M Anholcer, S Cichacz, I Peterin, A Tepeh
submitted, 2012
152012
Optimization of supply chain via reduction of complaints ratio
M Anholcer, A Kawa
KES International Symposium on Agent and Multi-Agent Systems: Technologies …, 2012
152012
The Nonlinear Generalized Transportation Problem with convex costs
M Anholcer
Croatian Operational Research Review 6 (1), 225-239, 2015
12*2015
Total vertex irregularity strength of forests
M Anholcer, M Karoński, F Pfender
arXiv preprint arXiv:1103.2087, 2011
122011
Product irregularity strength of graphs
M Anholcer
Discrete Mathematics 309 (22), 6434-6439, 2009
122009
Group irregularity strength of connected graphs
M Anholcer, S Cichacz, M Milanic
Journal of Combinatorial Optimization 30 (1), 1-17, 2015
102015
Spectra of graphs and closed distance magic labelings
M Anholcer, S Cichacz, I Peterin
102014
Zbieżność metody wyrównań dla nieliniowych zadań alokacji
M Anholcer
Zeszyty Naukowe/Akademia Ekonomiczna w Poznaniu, 183-198, 2005
102005
Algorithm for the Stochastic Generalized Transportation Problem
M Anholcer
Operations Research and Decisions 22 (4), 9-20, 2012
92012
Group sum chromatic number of graphs
M Anholcer, S Cichacz
European Journal of Combinatorics 55, 73-81, 2016
82016
Efficiency analysis of the Kaufmann and Desbazeille algorithm for the deadline problem
M Anholcer, H Gaspars-Wieloch
Operations Research and Decisions 21 (1), 5-18, 2011
82011
Majority choosability of digraphs
M Anholcer, B Bosek, J Grytczuk
The Electronic Journal of Combinatorics 24 (3), P3. 57, 2017
72017
Majority choosability of digraphs
M Anholcer, B Bosek, J Grytczuk
arXiv preprint arXiv:1608.06912, 2016
72016
Note on Distance Magic Products G ∘ C 4
M Anholcer, S Cichacz
Graphs and Combinatorics 5 (31), 1117-1124, 2015
72015
Note on distance magic products G◦ C4
M Anholcer, S Cichacz
preprint, 2013
7*2013
The system can't perform the operation now. Try again later.
Articles 1–20