default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Zak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j40]Agnieszka Czapiewska, Andrzej Luksza, Ryszard Studanski, Lukasz Wojewódka, Andrzej Zak:
Evaluation of Selected Modulation Techniques in Underwater Multipath Channel. IEEE Access 13: 13395-13404 (2025)- 2024
- [j39]Agnieszka Czapiewska, Andrzej Luksza, Ryszard Studanski, Lukasz Wojewódka
, Andrzej Zak:
Comparison of Doppler Effect Estimation Methods for MFSK Transmission in Multipath Hydroacoustic Channel. IEEE Access 12: 49976-49986 (2024) - 2023
- [j38]Andrzej Zak:
A note on the integrity of grids. Discret. Appl. Math. 341: 55-59 (2023) - [j37]Andrzej Rucinski, Andrzej Zak:
Constructing sparsest ℓ-hamiltonian saturated k-uniform hypergraphs for a wide range of ℓ. Eur. J. Comb. 109: 103659 (2023) - 2022
- [j36]Jerzy Konarski, Mariusz Wozniak, Andrzej Zak:
A note on packing of uniform hypergraphs. Discuss. Math. Graph Theory 42(4): 1383-1388 (2022) - [c2]Agnieszka Lazarowska, Andrzej Zak:
Real-time path planning for Autonomous Navigation Systems of Unmanned Surface Vehicles. MMAR 2022: 408-413 - 2021
- [j35]Jakub Przybylo, Andrzej Zak:
Largest Component and Node Fault Tolerance for Grids. Electron. J. Comb. 28(1): 1 (2021) - [j34]Jerzy Mizeraczyk, Ryszard Studanski, Andrzej Zak, Agnieszka Czapiewska:
A Method for Underwater Wireless Data Transmission in a Hydroacoustic Channel under NLOS Conditions. Sensors 21(23): 7825 (2021) - 2020
- [j33]Andrzej Rucinski, Andrzej Zak:
On the Minimum Size of Hamilton Saturated Hypergraphs. Electron. J. Comb. 27(4): 4 (2020) - [j32]Agnieszka Czapiewska, Andrzej Luksza, Ryszard Studanski, Andrzej Zak:
Reduction of the Multipath Propagation Effect in a Hydroacoustic Channel Using Filtration in Cepstrum. Sensors 20(3): 751 (2020) - [j31]Agnieszka Czapiewska, Andrzej Luksza, Ryszard Studanski, Andrzej Zak:
Application of Diversity Combining with RLS Adaptive Filtering in Data Transmission in a Hydroacoustic Channel. Sensors 20(24): 7255 (2020)
2010 – 2019
- 2019
- [j30]Andrzej Zak:
Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs. Discret. Appl. Math. 255: 299-306 (2019) - 2017
- [j29]Andrzej Zak:
Packing large trees of consecutive orders. Discret. Math. 340(2): 252-263 (2017) - [j28]Jerzy Konarski, Andrzej Zak:
Near packings of two graphs. Discret. Math. 340(5): 963-968 (2017) - 2016
- [j27]Agnieszka Görlich, Andrzej Zak:
On Erdős-Sós Conjecture for Trees of Large Size. Electron. J. Comb. 23(1): 1 (2016) - [j26]Andrzej Rucinski, Andrzej Zak:
Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [j25]Andrzej Zak:
General lower bound on the size of (H;k)-stable graphs. J. Comb. Optim. 29(2): 367-372 (2015) - 2014
- [j24]Andrzej Zak:
A generalization of an independent set with application to (Kp;k)-stable graphs. Discret. Appl. Math. 162: 421-427 (2014) - [j23]Andrzej Zak:
On embedding graphs with bounded sum of size and maximum degree. Discret. Math. 329: 12-18 (2014) - [j22]Andrzej Zak:
On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree. SIAM J. Discret. Math. 28(4): 1686-1698 (2014) - 2013
- [j21]Andrzej Rucinski, Andrzej Zak:
Hamilton Saturated Hypergraphs of Essentially Minimum Size. Electron. J. Comb. 20(2): 25 (2013) - [j20]Andrzej Zak:
Near Packings of Graphs. Electron. J. Comb. 20(2): 36 (2013) - [j19]Andrzej Zak:
Growth order for the size of smallest hamiltonian chain saturated uniform hypergraphs. Eur. J. Comb. 34(4): 724-735 (2013) - [j18]Andrzej Zak:
On (Kq;k)-Stable Graphs. J. Graph Theory 74(2): 216-221 (2013) - 2012
- [j17]Sylwia Cichacz, Agnieszka Görlich, Mateusz Nikodem, Andrzej Zak:
A lower bound on the size of (H; 1)-vertex stable graphs. Discret. Math. 312(20): 3026-3029 (2012) - [j16]Agnieszka Görlich, Andrzej Zak:
Sparse graphs of girth at least five are packable. Discret. Math. 312(24): 3606-3613 (2012) - [j15]Andrzej Zak, Aneta Dudek:
On Hamilton-chain saturated uniform hypergraphs. Discret. Math. Theor. Comput. Sci. 14(1): 21-28 (2012) - 2011
- [j14]Sylwia Cichacz, Agnieszka Görlich, Malgorzata Zwonek, Andrzej Zak:
On (Cn;k) Stable Graphs. Electron. J. Comb. 18(1) (2011) - [j13]Andrzej Zak:
A note on k-placeable graphs. Discret. Math. 311(22): 2634-2636 (2011) - 2010
- [j12]Aneta Dudek, Andrzej Zak, Gyula Y. Katona:
Hamilton-chain saturated hypergraphs. Discret. Math. 310(6-7): 1172-1176 (2010) - [j11]Aneta Dudek, Andrzej Zak:
On vertex stability with regard to complete bipartite subgraphs. Discuss. Math. Graph Theory 30(4): 663-669 (2010) - [j10]Andrzej Zak:
Dissections of Polygons into Convex Polygons. Int. J. Comput. Geom. Appl. 20(2): 223-244 (2010) - [j9]Agnieszka Görlich, Andrzej Zak:
On Packable Digraphs. SIAM J. Discret. Math. 24(2): 552-557 (2010)
2000 – 2009
- 2009
- [j8]Andrzej Zak:
A note on perfect dissections of an equilateral triangle. Australas. J Comb. 44: 87-94 (2009) - [j7]Agnieszka Görlich, Andrzej Zak:
A Note on Packing Graphs Without Cycles of Length up to Five. Electron. J. Comb. 16(1) (2009) - [j6]Artur Fortuna, Zdzislaw Skupien, Andrzej Zak:
Maximizing hamiltonian pairs and k-sets via numerous leaves in a tree. Discret. Math. 309(6): 1788-1792 (2009) - [j5]Andrzej Zak:
Harmonious order of graphs. Discret. Math. 309(20): 6055-6064 (2009) - 2008
- [j4]Zdzislaw Skupien, Andrzej Zak:
Rainbow regular order of graphs. Australas. J Comb. 42: 115-128 (2008) - 2007
- [j3]Waclaw Frydrych, Andrzej Zak:
Preface to Proceedings. Discuss. Math. Graph Theory 27(3): 561- (2007) - 2006
- [j2]Waclaw Frydrych, Andrzej Zak:
Preface to proceedings. Discuss. Math. Graph Theory 26(2): 279- (2006) - 2005
- [j1]Andrzej Zak:
Dissection of a Triangle into Similar Triangles. Discret. Comput. Geom. 34(2): 295-312 (2005) - [c1]Andrzej Zak:
Walsh transform as method of mimo systems identification. ICINCO 2005: 200-204
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-02-07 23:47 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:
