Marcin Anholcer

Orcid: 0000-0001-7322-7095

According to our database1, Marcin Anholcer authored at least 23 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Majority choosability of countable graphs.
Eur. J. Comb., March, 2024

On a many-sided matching problem with mixed preferences.
Oper. Res. Decis., 2024

Total vertex product irregularity strength of graphs.
Discuss. Math. Graph Theory, 2024

2023
On b-acyclic chromatic number of a graph.
Comput. Appl. Math., February, 2023

2021
Group distance magic and antimagic hypercubes.
Discret. Math., 2021

2019
Weight choosability of oriented hypergraphs.
Ars Math. Contemp., 2019

Deriving priorities from inconsistent PCM using network algorithms.
Ann. Oper. Res., 2019

Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs.
Appl. Math. Comput., 2019

Note on the group edge irregularity strength of graphs.
Appl. Math. Comput., 2019

2017
Majority Choosability of Digraphs.
Electron. J. Comb., 2017

Group Irregular Labelings of Disconnected Graphs.
Contributions Discret. Math., 2017

2016
Group sum chromatic number of graphs.
Eur. J. Comb., 2016

Spectra of graphs and closed distance magic labelings.
Discret. Math., 2016

2015
Group irregularity strength of connected graphs.
J. Comb. Optim., 2015

Distance Magic Labeling and Two Products of Graphs.
Graphs Comb., 2015

Note on Distance Magic Products G ∘ C<sub>4</sub>.
Graphs Comb., 2015

Group distance magic labeling of direct product of graphs.
Ars Math. Contemp., 2015

2014
Product irregularity strength of certain graphs.
Ars Math. Contemp., 2014

2012
Irregular labelings of circulant graphs.
Discret. Math., 2012

Optimization of Supply Chain via Reduction of Complaints Ratio.
Proceedings of the Agent and Multi-Agent Systems. Technologies and Applications, 2012

2011
A simplified implementation of the least squares solution for pairwise comparisons matrices.
Central Eur. J. Oper. Res., 2011

2009
A new upper bound for the total vertex irregularity strength of graphs.
Discret. Math., 2009

Product irregularity strength of graphs.
Discret. Math., 2009


  Loading...