default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStanislaw Bylka
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i1]Stanislaw Ambroszkiewicz, Waldemar Bartyna, Stanislaw Bylka:
Functionals in the Clouds: An abstract architecture of serverless Cloud-Native Apps. CoRR abs/2105.10362 (2021)- 2020
- [j12]Stanislaw Bylka
, Andrzej Wieczorek:
Relatively optimal production-distribution plans for stock management in supply chains over a finite time horizon. Comput. Ind. Eng. 144: 106445 (2020) - [j11]Stanislaw Bylka:
The consignment stock of inventories under buyer's warehouse space limitation. Int. J. Prod. Res. 58(3): 912-930 (2020)
2010 – 2019
- 2018
- [j10]Stanislaw Bylka, Andrzej Krupa:
A note on the Optimal Periodic Pattern (OPP) algorithm for the system in which buyers periodically order from a vendor. Comput. Ind. Eng. 115: 37-40 (2018) - 2015
- [j9]Stanislaw Bylka, Piotr Górny:
The consignment stock of inventories in coordinated model with generalized policy. Comput. Ind. Eng. 82: 54-64 (2015)
2000 – 2009
- 2007
- [j8]Stanislaw Bylka, Jan Komar:
The representation of multi-hypergraphs by set intersections. Discuss. Math. Graph Theory 27(3): 565-582 (2007) - [p1]Stanislaw Bylka, Ryszarda Rempala:
On a Nonlinear Production-Inventory Problem. Advances in Information Processing and Protection 2007: 447-457 - 2005
- [j7]Stanislaw Bylka:
Arithmetically maximal independent sets in infinite graphs. Discuss. Math. Graph Theory 25(1-2): 167-182 (2005) - 2004
- [j6]Xiao-Dong Zhang, Stanislaw Bylka:
Disjoint Triangles of a Cubic Line Graph. Graphs Comb. 20(2): 275-280 (2004) - 2001
- [j5]Stanislaw Bylka:
Local improving algorithms for large cuts in graphs with maximum degree three. Discret. Math. 235(1-3): 53-67 (2001) - 2000
- [j4]Stanislaw Bylka, Stanislaw Ambroszkiewicz, Jan Komar:
Discrete time dynamic game model for price competition in an oligopoly. Ann. Oper. Res. 97(1-4): 69-89 (2000)
1990 – 1999
- 1999
- [j3]Stanislaw Bylka, Adam Idzik, Zsolt Tuza:
Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality. Discret. Math. 194(1-3): 39-58 (1999) - [j2]Stanislaw Bylka, Adam Idzik, Jan Komar:
Bipartite Subgraphs of Graphs with Maximum Degree Three. Graphs Comb. 15(2): 129-136 (1999) - 1997
- [j1]Stanislaw Bylka, Jan Komar:
Intersection properties of line graphs. Discret. Math. 164(1-3): 33-45 (1997)
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 2025-01-20 22:53 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:
