default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Anholcer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j22]Marcin Anholcer
, Azam Sadat Emadi, Doost Ali Mojdeh:
Total vertex product irregularity strength of graphs. Discuss. Math. Graph Theory 44(4): 1261-1276 (2024)- [j21]Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk:
Majority choosability of countable graphs. Eur. J. Comb. 117: 103829 (2024) - [j20]Marcin Anholcer, Maciej Bartkowiak:
On a many-sided matching problem with mixed preferences. Oper. Res. Decis. 34(3) (2024) - 2023
- [j19]Marcin Anholcer, Sylwia Cichacz, Iztok Peterin:
On b-acyclic chromatic number of a graph. Comput. Appl. Math. 42(1) (2023) - 2021
- [j18]Marcin Anholcer, Sylwia Cichacz, Dalibor Froncek, Rinovia Simanjuntak, Jiangyi Qiu:
Group distance magic and antimagic hypercubes. Discret. Math. 344(12): 112625 (2021) - 2019
- [j17]Marcin Anholcer, Sylwia Cichacz, Jakub Przybylo:
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs. Appl. Math. Comput. 343: 149-155 (2019) - [j16]Marcin Anholcer, Sylwia Cichacz:
Note on the group edge irregularity strength of graphs. Appl. Math. Comput. 350: 237-241 (2019) - [j15]Marcin Anholcer, János Fülöp:
Deriving priorities from inconsistent PCM using network algorithms. Ann. Oper. Res. 274(1-2): 57-74 (2019) - [j14]Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk:
Weight choosability of oriented hypergraphs. Ars Math. Contemp. 16(1): 111-117 (2019) - 2017
- [j13]Marcin Anholcer, Sylwia Cichacz:
Group Irregular Labelings of Disconnected Graphs. Contributions Discret. Math. 12(2) (2017) - [j12]Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk:
Majority Choosability of Digraphs. Electron. J. Comb. 24(3): 3 (2017) - 2016
- [j11]Marcin Anholcer, Sylwia Cichacz, Iztok Peterin:
Spectra of graphs and closed distance magic labelings. Discret. Math. 339(7): 1915-1923 (2016) - [j10]Marcin Anholcer, Sylwia Cichacz:
Group sum chromatic number of graphs. Eur. J. Comb. 55: 73-81 (2016) - 2015
- [j9]Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh:
Group distance magic labeling of direct product of graphs. Ars Math. Contemp. 9(1): 93-107 (2015) - [j8]Marcin Anholcer, Sylwia Cichacz:
Note on Distance Magic Products G ∘ C4. Graphs Comb. 31(5): 1117-1124 (2015) - [j7]Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh:
Distance Magic Labeling and Two Products of Graphs. Graphs Comb. 31(5): 1125-1136 (2015) - [j6]Marcin Anholcer, Sylwia Cichacz, Martin Milanic:
Group irregularity strength of connected graphs. J. Comb. Optim. 30(1): 1-17 (2015) - 2014
- [j5]Marcin Anholcer:
Product irregularity strength of certain graphs. Ars Math. Contemp. 7(1): 23-29 (2014) - 2012
- [j4]Marcin Anholcer, Cory Palmer:
Irregular labelings of circulant graphs. Discret. Math. 312(23): 3461-3466 (2012) - 2011
- [j3]Marcin Anholcer, Volodymyr Babiy, Sándor Bozóki, Waldemar W. Koczkodaj:
A simplified implementation of the least squares solution for pairwise comparisons matrices. Central Eur. J. Oper. Res. 19(4): 439-444 (2011) - 2009
- [j2]Marcin Anholcer, Maciej Kalkowski, Jakub Przybylo:
A new upper bound for the total vertex irregularity strength of graphs. Discret. Math. 309(21): 6316-6317 (2009) - [j1]Marcin Anholcer:
Product irregularity strength of graphs. Discret. Math. 309(22): 6434-6439 (2009)
Conference and Workshop Papers
- 2012
- [c1]Marcin Anholcer, Arkadiusz Kawa:
Optimization of Supply Chain via Reduction of Complaints Ratio. KES-AMSTA 2012: 622-628
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
