zbMATH — the first resource for mathematics

Algorithmica

An International Journal in Computer Science

 Short Title: Algorithmica Publisher: Springer US, New York, NY ISSN: 0178-4617; 1432-0541/e Online: http://link.springer.com/journal/volumesAndIssues/453 Comments: Indexed cover-to-cover
 Documents Indexed: 3,016 Publications (since 1986) References Indexed: 2,225 Publications with 56,834 References.
all top 5

Latest Issues

 83, No. 9 (2021) 83, No. 8 (2021) 83, No. 7 (2021) 83, No. 6 (2021) 83, No. 5 (2021) 83, No. 4 (2021) 83, No. 3 (2021) 83, No. 2 (2021) 83, No. 1 (2021) 82, No. 12 (2020) 82, No. 11 (2020) 82, No. 10 (2020) 82, No. 9 (2020) 82, No. 8 (2020) 82, No. 7 (2020) 82, No. 6 (2020) 82, No. 5 (2020) 82, No. 4 (2020) 82, No. 3 (2020) 82, No. 2 (2020) 82, No. 1 (2020) 81, No. 11-12 (2019) 81, No. 10 (2019) 81, No. 9 (2019) 81, No. 8 (2019) 81, No. 7 (2019) 81, No. 6 (2019) 81, No. 5 (2019) 81, No. 4 (2019) 81, No. 3 (2019) 81, No. 2 (2019) 81, No. 1 (2019) 80, No. 12 (2018) 80, No. 11 (2018) 80, No. 10 (2018) 80, No. 9 (2018) 80, No. 8 (2018) 80, No. 7 (2018) 80, No. 6 (2018) 80, No. 5 (2018) 80, No. 4 (2018) 80, No. 3 (2018) 80, No. 2 (2018) 80, No. 1 (2018) 79, No. 4 (2017) 79, No. 3 (2017) 79, No. 2 (2017) 79, No. 1 (2017) 78, No. 4 (2017) 78, No. 3 (2017) 78, No. 2 (2017) 78, No. 1 (2017) 77, No. 4 (2017) 77, No. 3 (2017) 77, No. 2 (2017) 77, No. 1 (2017) 76, No. 4 (2016) 76, No. 3 (2016) 76, No. 2 (2016) 76, No. 1 (2016) 75, No. 4 (2016) 75, No. 3 (2016) 75, No. 2 (2016) 75, No. 1 (2016) 74, No. 4 (2016) 74, No. 3 (2016) 74, No. 2 (2016) 74, No. 1 (2016) 73, No. 4 (2015) 73, No. 3 (2015) 73, No. 2 (2015) 73, No. 1 (2015) 72, No. 4 (2015) 72, No. 3 (2015) 72, No. 2 (2015) 72, No. 1 (2015) 71, No. 4 (2015) 71, No. 3 (2015) 71, No. 2 (2015) 71, No. 1 (2015) 70, No. 4 (2014) 70, No. 3 (2014) 70, No. 2 (2014) 70, No. 1 (2014) 69, No. 4 (2014) 69, No. 3 (2014) 69, No. 2 (2014) 69, No. 1 (2014) 68, No. 4 (2014) 68, No. 3 (2014) 68, No. 2 (2014) 68, No. 1 (2014) 67, No. 4 (2013) 67, No. 3 (2013) 67, No. 2 (2013) 67, No. 1 (2013) 66, No. 4 (2013) 66, No. 3 (2013) 66, No. 2 (2013) 66, No. 1 (2013) ...and 251 more Volumes
all top 5

Authors

 33 Saurabh, Saket 25 Fomin, Fedor V. 24 Epstein, Leah 22 Mehlhorn, Kurt 19 Bodlaender, Hans L. 18 Demaine, Erik D. 18 Goodrich, Michael Truman 18 Raman, Venkatesh 17 Chen, Danny Ziyi 17 Navarro, Gonzalo 17 Sharir, Micha 17 Smid, Michiel H. M. 17 Spirakis, Paul G. 16 Bose, Prosenjit K. 16 Guibas, Leonidas John 16 Khuller, Samir 16 Levin, Asaf 16 Pilipczuk, Michał 15 Albers, Susanne 15 Doerr, Benjamin 15 Golovach, Petr A. 15 Kratsch, Dieter 15 Liotta, Giuseppe 15 Maheshwari, Anil 15 Nagamochi, Hiroshi 15 Paulusma, Daniël 15 Suri, Subhash 14 Agarwal, Pankaj Kumar 14 Azar, Yossi 14 Makino, Kazuhisa 14 Munro, J. Ian 14 Niedermeier, Rolf 14 Vitter, Jeffrey Scott 14 Witt, Carsten 13 Chazelle, Bernard 13 de Berg, Mark Theodoor 13 Eppstein, David Arthur 13 Heggernes, Pinar 13 Hong, Seok-Hee 13 Kaufmann, Michael 13 Langerman, Stefan 13 Marx, Dániel 13 Pilipczuk, Marcin 13 van Kreveld, Marc J. 12 Bansal, Nikhil 12 Chen, Jian-er 12 Lingas, Andrzej 12 Salavatipour, Mohammad R. 12 Shachnai, Hadas 12 Szpankowski, Wojciech 12 Woeginger, Gerhard Johannes 11 Chan, Timothy Moon-Yew 11 Chen, Zhizhong 11 Deng, Xiao-Tie 11 Fekete, Sándor P. 11 Gudmundsson, Joachim 11 Italiano, Giuseppe Francesco 11 Kaplan, Haim 11 Kortsarz, Guy 11 Lam, Tak-Wah 11 Mestre, Julián 11 Pruhs, Kirk R. 11 Sudholt, Dirk 11 Sung, Wing-Kin 11 Thilikos, Dimitrios M. 11 Wang, Haitao 11 Wang, Lusheng 10 Boissonnat, Jean-Daniel 10 Chrobak, Marek 10 Har-Peled, Sariel 10 Hershberger, John E. 10 Lokshtanov, Daniel 10 Morin, Pat 10 Preparata, Franco P. 10 Prodinger, Helmut 10 Reif, John H. 10 Roditty, Liam 10 Sack, Jörg-Rüdiger 10 Schlotter, Ildikó 10 Tamassia, Roberto 10 Zehavi, Meirav 9 Alon, Noga M. 9 Atallah, Mikhail J. 9 Bekos, Michael A. 9 Bonnet, Edouard 9 Carmi, Paz 9 Di Battista, Giuseppe 9 Du, Ding-Zhu 9 Eades, Peter 9 Elbassioni, Khaled M. 9 Fellows, Michael Ralph 9 Gaspers, Serge 9 Gutin, Gregory Z. 9 Hajiaghayi, Mohammad Taghi 9 Jansen, Klaus 9 Jiang, Minghui 9 Karp, Richard Manning 9 Katz, Matthew J. 9 Kavitha, Telikepalli 9 Kratsch, Stefan ...and 3,942 more Authors
all top 5

Fields

 2,698 Computer science (68-XX) 890 Combinatorics (05-XX) 450 Operations research, mathematical programming (90-XX) 141 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 95 General and overarching topics; collections (00-XX) 85 Biology and other natural sciences (92-XX) 79 Information and communication theory, circuits (94-XX) 63 Convex and discrete geometry (52-XX) 59 Numerical analysis (65-XX) 43 Probability theory and stochastic processes (60-XX) 26 Number theory (11-XX) 19 Quantum theory (81-XX) 18 Statistics (62-XX) 15 Mathematical logic and foundations (03-XX) 14 Linear and multilinear algebra; matrix theory (15-XX) 11 Mechanics of particles and systems (70-XX) 11 Systems theory; control (93-XX) 10 Geometry (51-XX) 8 Order, lattices, ordered algebraic structures (06-XX) 6 Group theory and generalizations (20-XX) 6 Geophysics (86-XX) 5 Manifolds and cell complexes (57-XX) 4 History and biography (01-XX) 4 Algebraic topology (55-XX) 3 Field theory and polynomials (12-XX) 3 Commutative algebra (13-XX) 3 Algebraic geometry (14-XX) 3 Dynamical systems and ergodic theory (37-XX) 2 Measure and integration (28-XX) 2 Special functions (33-XX) 2 Statistical mechanics, structure of matter (82-XX) 1 Approximations and expansions (41-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 Functional analysis (46-XX) 1 Calculus of variations and optimal control; optimization (49-XX) 1 Differential geometry (53-XX) 1 General topology (54-XX) 1 Global analysis, analysis on manifolds (58-XX) 1 Mechanics of deformable solids (74-XX)

Citations contained in zbMATH Open

2,173 Publications have been cited 16,495 times in 11,949 Documents Cited by Year
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Zbl 0642.68081
Guibas, Leonidas; Hershberger, John; Leven, Daniel; Sharir, Micha; Tarjan, Robert E.
1987
On-line construction of suffix trees. Zbl 0831.68027
Ukkonen, E.
1995
A modification of Karmarkar’s linear programming algorithm. Zbl 0626.90056
Vanderbei, Robert J.; Meketon, Marc S.; Freedman, Barry A.
1986
A sweepline algorithm for Voronoi diagrams. Zbl 0642.68079
Fortune, Steven
1987
Competitive snoopy caching. Zbl 0645.68034
Karlin, Anna R.; Manasse, Mark S.; Rudolph, Larry; Sleator, Daniel D.
1988
Primal-dual approximation algorithms for integral flow and multicut in trees. Zbl 0873.68075
Garg, N.; Vazirani, V. V.; Yannakakis, M.
1997
Approximation algorithms for connected dominating sets. Zbl 0895.68106
Guha, S.; Khuller, S.
1998
Geometric applications of a matrix-searching algorithm. Zbl 0642.68078
Aggarwal, Alok; Klawe, Maria M.; Moran, Shlomo; Shor, Peter; Wilber, Robert
1987
The dense $$k$$-subgraph problem. Zbl 0969.68117
Feige, U.; Kortsarz, G.; Peleg, D.
2001
A new proof for the existence of mutually unbiased bases. Zbl 1012.68069
Bandyopadhyay, Somshubhro; Boykin, P. Oscar; Roychowdhury, Vwani; Vatan, Farrokh
2002
Improved approximation algorithms for MAX $$k$$-cut and MAX BISECTION. Zbl 0873.68078
Frieze, A.; Jerrum, M.
1997
Fractional cascading. I: A data structuring technique. Zbl 0639.68056
Chazelle, Bernard; Guibas, Leonidas J.
1986
An extension of Karmarkar’s algorithm for linear programming using dual variables. Zbl 0621.90048
Todd, Michael J.; Burrell, Bruce P.
1986
Finding and counting given length cycles. Zbl 0865.68093
Alon, N.; Yuster, R.; Zwick, U.
1997
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Zbl 0753.05062
Borie, Richard B.; Parker, R. Gary; Tovey, Craig A.
1992
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs. Zbl 1016.68055
Alber, J.; Bodlaender, H. L.; Fernau, H.; Kloks, T.; Niedermeier, R.
2002
A linear-time algorithm for finding a sparse $$k$$-connected spanning subgraph of a $$k$$-connected graph. Zbl 0763.05065
Nagamochi, Hiroshi; Ibaraki, Toshihide
1992
Property testing in bounded degree graphs. Zbl 0990.68103
Goldreich, O.; Ron, D.
2002
Programming simultaneous actions using common knowledge. Zbl 0646.68031
Moses, Yoram; Tuttle, Mark R.
1988
Diameter and treewidth in minor-closed graph families. Zbl 0963.05128
Eppstein, D.
2000
Constrained Delaunay triangulations. Zbl 0664.68042
Chew, L. Paul
1989
Linear-time recognition of circular-arc graphs. Zbl 1060.68088
McConnell, Ross M.
2003
Ray shooting in polygons using geodesic triangulations. Zbl 0813.68158
Chazelle, B.; Edelsbrunner, H.; Grigni, M.; Guibas, L.; Hershberger, J.; Sharir, M.; Snoeyink, J.
1994
A subexponential bound for linear programming. Zbl 0857.68119
Matoušek, J.; Sharir, M.; Welzl, E.
1996
On implementing the push-relabel method for the maximum flow problem. Zbl 0898.68029
Cherkassky, B. V.; Goldberg, A. V.
1997
Proportionate progress: A notion of fairness in resource allocation. Zbl 0848.68020
Baruah, S. K.; Cohen, N. K.; Plaxton, C. G.; Varvel, D. A.
1996
Squares, cubes, and time-space efficient string searching. Zbl 0849.68044
Crochemore, M.; Rytter, W.
1995
The contraction method for recursive algorithms. Zbl 0967.68166
Rösler, U.; Rüschendorf, L.
2001
Drawing planar graphs using the canonical ordering. Zbl 0851.68086
Kant, G.
1996
A monotonic projective algorithm for fractional linear programming. Zbl 0625.90088
Anstreicher, Kurt M.
1986
Deciding $$k$$-colorability of $$P_5$$-free graphs in polynomial time. Zbl 1222.68083
2010
A strongly competitive randomized paging algorithm. Zbl 0731.68040
McGeoch, Lyle A.; Sleator, Daniel D.
1991
Randomized incremental construction of Delaunay and Voronoi diagrams. Zbl 0743.68128
Guibas, Leonidas J.; Knuth, Donald E.; Sharir, Micha
1992
On the power of randomization in on-line algorithms. Zbl 0784.68038
Ben-David, S.; Borodin, A.; Karp, R.; Tardos, G.; Wigderson, A.
1994
On approximating the longest path in a graph. Zbl 0876.68083
Karger, D.; Motwani, R.; Ramkumar, G. D. S.
1997
Approximating minimum feedback sets and multicuts in directed graphs. Zbl 0897.68078
Even, G.; Naor, J.; Schieber, B.; Sudan, M.
1998
Linear probing and graphs. Zbl 0918.68079
Knuth, D. E.
1998
An 11/6-approximation algorithm for the network Steiner problem. Zbl 0768.68192
Zelikovsky, A. Z.
1993
Representing trees of higher degree. Zbl 1086.68034
Benoit, David; Demaine, Erik D.; Munro, J. Ian; Raman, Rajeev; Raman, Venkatesh; Rao, S. Srinivasa
2005
Parallel computational geometry. Zbl 0664.68041
Aggarwal, A.; Chazelle, B.; Guibas, L.; Ó’Dúnlaing, Colm; Yap, C.
1988
Finding maximum induced matchings in subclasses of claw-free and $$P_5$$-free graphs, and in graphs with matching and induced matching of equal maximum size. Zbl 1082.68592
Kobler, Daniel; Rotics, Udi
2003
Geometric complexity of some location problems. Zbl 0639.68038
Lee, D. T.; Wu, Y. F.
1986
The relative complexity of approximate counting problems. Zbl 1138.68424
Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Jerrum, Mark
2004
Deterministic rendezvous in graphs. Zbl 1100.68077
Dessmark, Anders; Fraigniaud, Pierre; Kowalski, Dariusz R.; Pelc, Andrzej
2006
Incremental topological flipping works for regular triangulations. Zbl 0840.68050
Edelsbrunner, H.; Shah, N. R.
1996
Special issue: Average-case analysis of algorithms. Zbl 0969.00028
Prodinger, H. (ed.); Szpankowski, W. (ed.)
2001
A polynomial Newton method for linear programming. Zbl 0629.90058
de Ghellinck, Guy; Vial, Jean-Philippe
1986
Algorithms for the on-line travelling salesman. Zbl 0985.68088
Ausiello, G.; Feuerstein, E.; Leonardi, S.; Stougie, L.; Talamo, M.
2001
On two techniques of combining branching and treewidth. Zbl 1185.68475
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey A.
2009
Edge crossings in drawings of bipartite graphs. Zbl 0804.68107
1994
Minkowski-type theorems and least-squares clustering. Zbl 0895.68135
Aurenhammer, F.; Hoffmann, F.; Aronov, B.
1998
Fixed-parameter algorithms for CLOSEST STRING and related problems. Zbl 1058.68119
Gramm, Jens; Niedermeier, Rolf; Rossmanith, Peter
2003
Algorithms for graphs embeddable with few crossings per edge. Zbl 1131.68120
Grigoriev, Alexander; Bodlaender, Hans L.
2007
Visibility of disjoint polygons. Zbl 0611.68062
Asano, Takao; Asano, Tetsuo; Guibas, Leonidas; Hershberger, John; Imai, Hiroshi
1986
Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Zbl 0831.92014
Kececioglu, J.; Sankoff, D.
1995
Optimal time-critical scheduling via resource augmentation. Zbl 0990.68022
Phillips, C. A.; Stein, C.; Torng, E.; Wein, J.
2002
An $$O(ND)$$ difference algorithm and its variations. Zbl 0639.68054
Myers, Eugene W.
1986
A proof of the Gilbert-Pollak conjecture on the Steiner ratio. Zbl 0774.05027
Du, D.-Z.; Hwang, F. K.
1992
On the analysis of linear probing hashing. Zbl 0914.68105
Flajolet, P.; Poblete, P.; Viola, A.
1998
Algorithmic meta-theorems for restrictions of treewidth. Zbl 1252.68154
Lampis, Michael
2012
On the minimum feedback vertex set problem: Exact and enumeration algorithms. Zbl 1170.68029
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.; Razgon, Igor
2008
On-line maintenance of triconnected components with SPQR-trees. Zbl 0843.68088
Di Battista, G.; Tamassia, R.
1996
A geometric view of parametric linear programming. Zbl 0767.90042
Adler, Ilan; Monteiro, Renato D. C.
1992
$$L_ 1$$ shortest paths among polygonal obstacles in the plane. Zbl 0753.68093
Mitchell, Joseph S. B.
1992
Quasi-optimal upper bounds for simplex range searching and new zone theorems. Zbl 0788.68141
Chazelle, Bernard; Sharir, Micha; Welzl, Emo
1992
Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Zbl 0866.68077
1997
Multiplicative drift analysis. Zbl 1264.68220
Doerr, Benjamin; Johannsen, Daniel; Winzen, Carola
2012
Speeding up two string-matching algorithms. Zbl 0942.68574
Crochemore, M.; Czumaj, A.; Gasieniec, L.; Jarominek, S.; Lecroq, T.; Plandowski, W.; Rytter, W.
1994
On a kernel-based method for pattern recognition, regression, approximation, and operator inversion. Zbl 0910.68189
Smola, A. J.; Schölkopf, B.
1998
Randomized search trees. Zbl 0857.68030
Seidel, R.; Aragon, C. R.
1996
Reactive local search for the maximum clique problem. Zbl 0985.68016
Battiti, R.; Protasi, M.
2001
Primal-dual algorithms for connected facility location problems. Zbl 1108.90026
Swamy, Chaitanya; Kumar, Amit
2004
Chordal deletion is fixed-parameter tractable. Zbl 1220.05066
Marx, Dániel
2010
Solving connected dominating set faster than $$2^n$$. Zbl 1170.68030
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter
2008
Mehlhorn, Kurt; Näher, Stefan
1990
Optimal search and one-way trading online algorithms. Zbl 0984.68043
El-Yaniv, R.; Fiat, A.; Karp, R. M.; Turpin, G.
2001
The pairing heap: A new form of self-adjusting heap. Zbl 0611.68042
Fredman, Michael L.; Sedgewick, Robert; Sleator, Daniel D.; Tarjan, Robert E.
1986
The longest common subsequence problem revisited. Zbl 0636.68083
Apostolico, A.; Guerra, C.
1987
A new measure for the study of on-line algorithms. Zbl 0782.68052
Ben-David, S.; Borodin, A.
1994
Selfish load balancing and atomic congestion games. Zbl 1107.68026
Suri, Subhash; Tóth, Csaba D.; Zhou, Yunhong
2007
A multiplicative barrier function method for linear programming. Zbl 0641.90048
Iri, Masao; Imai, Hiroshi
1986
The performance of neighbor-joining methods of phylogenetic reconstruction. Zbl 0938.68747
Atteson, K.
1999
Discrete logarithms in $$\mathrm{GF}(p)$$. Zbl 0631.12010
Coppersmith, Don; Odlyzko, Andrew M.; Schroeppel, Richard
1986
Exact and approximation algorithms for clustering. Zbl 0994.68178
Agarwal, P. K.; Procopiuc, C. M.
2002
Automated generation of search tree algorithms for hard graphs modification problems. Zbl 1090.68027
Gramm, Jens; Guo, Jiong; Hüffner, Falk; Niedermeier, Rolf
2004
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Zbl 1208.90149
Kellerer, Hans; Strusevich, Vitaly A.
2010
Designing networks with compact routing tables. Zbl 0646.68087
Frederickson, Greg N.; Janardan, Ravi
1988
Upward drawings of triconnected digraphs. Zbl 1211.68477
Bertolazzi, P.; Di Battista, G.; Liotta, G.; Mannino, C.
1994
Applications of the crossing number. Zbl 0851.68088
Pach, J.; Shahrokhi, F.; Szegedy, M.
1996
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Zbl 0857.68055
Alon, N.; Naor, M.
1996
Geometry helps in bottleneck matching and related problems. Zbl 0980.68101
Efrat, A.; Itai, A.; Katz, M. J.
2001
Short cycles make $$W$$-hard problems hard: FPT algorithms for $$W$$-hard problems in graphs with no short cycles. Zbl 1170.68019
Raman, Venkatesh; Saurabh, Saket
2008
Forests, frames, and games: Algorithms for matroid sums and applications. Zbl 0771.05026
Gabow, Harold N.; Westermann, Herbert H.
1992
DNA physical mapping and alternating Eulerian cycles in colored graphs. Zbl 0840.92011
Pevzner, P. A.
1995
Computing the cover array in linear time. Zbl 0995.68189
Li, Y.; Smyth, W. F.
2002
Black-box search by unbiased variation. Zbl 1264.68221
Lehre, Per Kristian; Witt, Carsten
2012
A robust model for finding optimal evolutionary tree. Zbl 0831.92019
Farach, M.; Kannan, S.; Warnow, T.
1995
Approximating min sum set cover. Zbl 1082.68126
Feige, Uriel; Lovász, László; Tetali, Prasad
2004
The price of selfish routing. Zbl 1137.91007
Mavronicolas, Marios; Spirakis, Paul
2007
Optimal coding and sampling of triangulations. Zbl 1106.68114
Poulalhon, Dominique; Schaeffer, Gilles
2006
Parameterized dynamic cluster editing. Zbl 07303842
Luo, Junjie; Molter, Hendrik; Nichterlein, André; Niedermeier, Rolf
2021
Fault-tolerant covering problems in metric spaces. Zbl 07328480
Bhowmick, Santanu; Inamdar, Tanmay; Varadarajan, Kasturi
2021
Eternal domination: $$D$$-dimensional Cartesian and strong grids and everything in between. Zbl 07335029
Mc Inerney, Fionn; Nisse, Nicolas; Pérennes, Stéphane
2021
Popular matchings in complete graphs. Zbl 07335030
Cseh, Ágnes; Kavitha, Telikepalli
2021
Mim-width. II. The feedback vertex set problem. Zbl 1442.05158
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
2020
Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata. Zbl 1437.68091
Asinowski, Andrei; Bacher, Axel; Banderier, Cyril; Gittenberger, Bernhard
2020
Counting induced subgraphs: a topological approach to #W[1]-hardness. Zbl 1452.68086
Roth, Marc; Schmitt, Johannes
2020
Succinct non-overlapping indexing. Zbl 1436.68083
Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.
2020
QuickXsort: a fast sorting scheme in theory and practice. Zbl 1447.68003
Edelkamp, Stefan; Weiß, Armin; Wild, Sebastian
2020
Patterns in random permutations avoiding some sets of multiple patterns. Zbl 1446.60010
Janson, Svante
2020
Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments. Zbl 1436.91019
Berbeglia, Gerardo; Joret, Gwenaël
2020
Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. Zbl 1435.68389
Huang, Chien-Chung; Kakimura, Naonori; Yoshida, Yuichi
2020
Study of a combinatorial game in graphs through linear programming. Zbl 1437.91112
Cohen, Nathann; McInerney, Fionn; Nisse, Nicolas; Pérennes, Stéphane
2020
Colouring $$(P_r + P_s)$$-free graphs. Zbl 1441.68095
Klimošová, Tereza; Malík, Josef; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Slívová, Veronika
2020
Parameterized aspects of strong subgraph closure. Zbl 1442.68168
Golovach, Petr A.; Heggernes, Pinar; Konstantinidis, Athanasios L.; Lima, Paloma T.; Papadopoulos, Charis
2020
Compressed dynamic range majority and minority data structures. Zbl 07202656
Gagie, Travis; He, Meng; Navarro, Gonzalo
2020
On the tractability of optimization problems on $$H$$-graphs. Zbl 1447.05142
Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent
2020
The inverse Voronoi problem in graphs. I: Hardness. Zbl 1455.68135
Bonnet, Édouard; Cabello, Sergio; Mohar, Bojan; Pérez-Rosés, Hebert
2020
Best-case and worst-case sparsifiability of Boolean CSPs. Zbl 1452.68176
Chen, Hubie; Jansen, Bart M. P.; Pieterse, Astrid
2020
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs. Zbl 1452.68131
Barbero, Florian; Isenmann, Lucas; Thiebaut, Jocelyn
2020
Parameterized leaf power recognition via embedding into graph products. Zbl 1452.68135
Eppstein, David; Havvaei, Elham
2020
Parameterized complexity of geometric covering problems having conflicts. Zbl 1436.68145
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha; Saurabh, Saket
2020
Connected vertex cover for $$(sP_1+P_5)$$-free graphs. Zbl 1436.68245
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
2020
Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts. Zbl 1436.68403
Brubach, Brian; Sankararaman, Karthik A.; Srinivasan, Aravind; Xu, Pan
2020
Embedding small digraphs and permutations in binary trees and split trees. Zbl 1444.05120
Albert, Michael; Holmgren, Cecilia; Johansson, Tony; Skerman, Fiona
2020
On the relation of strong triadic closure and cluster deletion. Zbl 1435.68235
Grüttemeier, Niels; Komusiewicz, Christian
2020
Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster. Zbl 1435.68405
Hagerup, Torben
2020
Fast compressed self-indexes with deterministic linear-time construction. Zbl 1433.68105
Munro, J. Ian; Navarro, Gonzalo; Nekrich, Yakov
2020
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. Zbl 1433.68279
Bergougnoux, Benjamin; Kanté, Mamadou Moustapha; Kwon, O-joung
2020
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. Zbl 1433.68307
Pilipczuk, Michał; van Leeuwen, Erik Jan; Wiese, Andreas
2020
Parameterized complexity of conflict-free matchings and paths. Zbl 1442.68072
Agrawal, Akanksha; Jain, Pallavi; Kanesh, Lawqueen; Saurabh, Saket
2020
A constant-time algorithm for middle levels Gray codes. Zbl 1433.94147
Mütze, Torsten; Nummenpalo, Jerri
2020
Queue layouts of planar 3-trees. Zbl 1457.05024
Alam, Jawaherul Md.; Bekos, Michael A.; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey
2020
Compression of dynamic graphs generated by a duplication model. Zbl 1453.68075
Turowski, Krzysztof; Magner, Abram; Szpankowski, Wojciech
2020
The power of linear-time data reduction for maximum matching. Zbl 07272772
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf
2020
Enumerating $$k$$-Arc-connected orientations. Zbl 07272774
Blind, Sarah; Knauer, Kolja; Valicov, Petru
2020
An adversarial model for scheduling with testing. Zbl 07272776
Dürr, Christoph; Erlebach, Thomas; Megow, Nicole; Meißner, Julie
2020
On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms. Zbl 07272777
Corus, Dogan; Oliveto, Pietro S.
2020
Subexponential-time algorithms for maximum independent set in $$P_t$$-free and broom-free graphs. Zbl 1428.05291
Bacsó, Gábor; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Tuza, Zsolt; van Leeuwen, Erik Jan
2019
Computing the number of induced copies of a fixed graph in a bounded degree graph. Zbl 1421.68140
Patel, Viresh; Regts, Guus
2019
Independent feedback vertex set for $$P_5$$-free graphs. Zbl 1422.68105
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
2019
Track layouts, layered path decompositions, and leveled planarity. Zbl 1421.68105
Bannister, Michael J.; Devanny, William E.; Dujmović, Vida; Eppstein, David; Wood, David R.
2019
Running time analysis of the $$(1+1)$$-EA for OneMax and LeadingOnes under bit-wise noise. Zbl 1411.68147
Qian, Chao; Bian, Chao; Jiang, Wu; Tang, Ke
2019
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? Zbl 1430.68126
Bougeret, Marin; Sau, Ignasi
2019
Clustered planarity with pipes. Zbl 1421.68103
Angelini, Patrizio; Da Lozzo, Giordano
2019
The $$(1+\lambda)$$ evolutionary algorithm with self-adjusting mutation rate. Zbl 1411.68143
Doerr, Benjamin; Gießen, Christian; Witt, Carsten; Yang, Jing
2019
Polynomial cases for the vertex coloring problem. Zbl 1444.68078
Karthick, T.; Maffray, Frédéric; Pastor, Lucas
2019
Temporal network optimization subject to connectivity constraints. Zbl 1421.68139
Mertzios, George B.; Michail, Othon; Spirakis, Paul G.
2019
Cutwidth: obstructions and algorithmic aspects. Zbl 1414.68035
Giannopoulou, Archontia C.; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin
2019
Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax. Zbl 1414.68107
Witt, Carsten
2019
Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints. Zbl 1411.68149
Shi, Feng; Schirneck, Martin; Friedrich, Tobias; Kötzing, Timo; Neumann, Frank
2019
Fixed-parameter approximations for $$k$$-center problems in low highway dimension graphs. Zbl 1418.68241
Feldmann, Andreas Emil
2019
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. Zbl 1430.68179
Bonnet, Édouard; Brettell, Nick; Kwon, O-joung; Marx, Dániel
2019
Mind the gap! Zbl 1412.68075
Amir, Amihood; Kopelowitz, Tsvi; Levy, Avivit; Pettie, Seth; Porat, Ely; Shalom, B. Riva
2019
Optimization with demand oracles. Zbl 1421.68194
Badanidiyuru, Ashwinkumar; Dobzinski, Shahar; Oren, Sigal
2019
A general purpose algorithm for counting simple cycles and simple paths of any length. Zbl 1423.05171
Giscard, Pierre-Louis; Kriege, Nils; Wilson, Richard C.
2019
Size versus truthfulness in the house allocation problem. Zbl 1431.91257
Krysta, Piotr; Manlove, David; Rastegari, Baharak; Zhang, Jinshan
2019
NodeTrix planarity testing with small clusters. Zbl 1429.68187
Di Giacomo, Emilio; Liotta, Giuseppe; Patrignani, Maurizio; Rutter, Ignaz; Tappini, Alessandra
2019
Deleting vertices to graphs of bounded genus. Zbl 1429.68194
Kociumaka, Tomasz; Pilipczuk, Marcin
2019
On plane constrained bounded-degree spanners. Zbl 1422.68242
Bose, Prosenjit; Fagerberg, Rolf; van Renssen, André; Verdonschot, Sander
2019
Expand the shares together: envy-free mechanisms with a small number of cuts. Zbl 1426.91148
2019
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains. Zbl 1410.68374
Mitchell, Joseph S. B.; Polishchuk, Valentin; Sysikaski, Mikko; Wang, Haitao
2019
Assortment planning with nested preferences: dynamic programming with distributions as states? Zbl 1415.90142
Segev, Danny
2019
Level-based analysis of the univariate marginal distribution algorithm. Zbl 1411.68140
Dang, Duc-Cuong; Lehre, Per Kristian; Nguyen, Phan Trung Hai
2019
Turing kernelization for finding long paths in graph classes excluding a topological minor. Zbl 1430.68219
Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin
2019
An exponential lower bound for cut sparsifiers in planar graphs. Zbl 1430.68220
Karpov, Nikolai; Pilipczuk, Marcin; Zych-Pawlewicz, Anna
2019
An EPTAS for scheduling on unrelated machines of few different types. Zbl 1439.90034
Jansen, Klaus; Maack, Marten
2019
Universal slope sets for 1-bend planar drawings. Zbl 1421.68102
Angelini, Patrizio; Bekos, Michael A.; Liotta, Giuseppe; Montecchiani, Fabrizio
2019
Two problems in max-size popular matchings. Zbl 1426.91170
Brandl, Florian; Kavitha, Telikepalli
2019
A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints. Zbl 1421.68181
Subramani, K.; Wojciechowki, Piotr
2019
Can we recover the cover? Zbl 1423.68618
Amir, Amihood; Levy, Avivit; Lewenstein, Moshe; Lubin, Ronit; Porat, Benny
2019
A unified framework for designing EPTAS for load balancing on parallel machines. Zbl 1421.68235
Kones, Ishai; Levin, Asaf
2019
Minmax regret $$k$$-sink location on a dynamic path network with uniform capacities. Zbl 1431.90031
Arumugam, Guru Prakash; Augustine, John; Golin, Mordecai J.; Srikanthan, Prashanth
2019
The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases. Zbl 1412.90077
Lesca, Julien; Minoux, Michel; Perny, Patrice
2019
A simple projection algorithm for linear programming problems. Zbl 1423.90137
Kitahara, Tomonari; Sukegawa, Noriyoshi
2019
Sorting by swaps with noisy comparisons. Zbl 1411.68145
Gavenčiak, Tomáš; Geissmann, Barbara; Lengler, Johannes
2019
Island models meet rumor spreading. Zbl 1411.68142
Doerr, Benjamin; Fischbeck, Philipp; Frahnow, Clemens; Friedrich, Tobias; Kötzing, Timo; Schirneck, Martin
2019
An efficient strongly connected components algorithm in the fault tolerant model. Zbl 1418.68159
Baswana, Surender; Choudhary, Keerti; Roditty, Liam
2019
Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques. Zbl 1418.05120
Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
2019
On the separation and equivalence of paging strategies and other online algorithms. Zbl 1418.68246
Angelopoulos, Spyros; Dorrigiv, Reza; López-Ortiz, Alejandro
2019
Distributed methods for computing approximate equilibria. Zbl 1422.91052
Czumaj, Artur; Deligkas, Argyrios; Fasoulakis, Michail; Fearnley, John; Jurdziński, Marcin; Savani, Rahul
2019
Faster algorithms for security games on matroids. Zbl 1422.91035
2019
Optimal data reduction for graph coloring using low-degree polynomials. Zbl 1430.68128
Jansen, Bart M. P.; Pieterse, Astrid
2019
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. Zbl 1430.68032
Björklund, Andreas; Kaski, Petteri; Williams, Ryan
2019
Optimal online two-way trading with bounded number of transactions. Zbl 1431.68162
Fung, Stanley P. Y.
2019
$$O(f)$$ bi-criteria approximation for capacitated covering with hard capacities. Zbl 1421.68232
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T.
2019
Characterizing and recognizing 4-map graphs. Zbl 1423.05050
Brandenburg, Franz J.
2019
Online dominating set. Zbl 1421.68239
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S.
2019
When can graph hyperbolicity be computed in linear time? Zbl 1439.68016
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod
2019
On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings. Zbl 1421.68106
Bekos, Michael A.; Förster, Henry; Kaufmann, Michael
2019
Succinct summing over sliding windows. Zbl 1421.68195
Ben Basat, Ran; Einziger, Gil; Friedman, Roy; Kassner, Yaron
2019
Computing dense tensor decompositions with optimal dimension trees. Zbl 1421.68259
Kaya, Oguz; Robert, Yves
2019
Hierarchical partial planarity. Zbl 1421.68101
Angelini, Patrizio; Bekos, Michael A.
2019
Covering uncertain points in a tree. Zbl 1421.68031
Wang, Haitao; Zhang, Jingru
2019
Computing $$L_1$$ shortest paths among polygonal obstacles in the plane. Zbl 1421.68164
Chen, Danny Z.; Wang, Haitao
2019
Revisiting connected dominating sets: an almost optimal local information algorithm. Zbl 1421.68233
Khuller, Samir; Yang, Sheng
2019
Region-based approximation of probability distributions (for visibility between imprecise points among obstacles). Zbl 1421.68160
Buchin, Kevin; Kostitsyna, Irina; Löffler, Maarten; Silveira, Rodrigo I.
2019
Full characterization of a class of graphs tailored for software watermarking. Zbl 1421.68107
Bento, Lucila M. S.; Boccardo, Davidson R.; Machado, Raphael C. S.; Pereira de Sá, Vinícius G.; Szwarcfiter, Jayme L.
2019
Optimality program in segment and string graphs. Zbl 1423.68331
Bonnet, Édouard; Rzążewski, Paweł
2019
Stable secretaries. Zbl 1423.68605
Babichenko, Yakov; Emek, Yuval; Feldman, Michal; Patt-Shamir, Boaz; Peretz, Ron; Smorodinsky, Rann
2019
...and 1222 more Documents
all top 5

Cited by 12,693 Authors

 89 Saurabh, Saket 76 Epstein, Leah 74 Sharir, Micha 73 Golovach, Petr A. 67 Fomin, Fedor V. 63 Paulusma, Daniël 60 Navarro, Gonzalo 57 Liotta, Giuseppe 55 Bose, Prosenjit K. 52 de Berg, Mark Theodoor 52 Niedermeier, Rolf 51 Nagamochi, Hiroshi 51 Xu, Dachuan 48 Lokshtanov, Daniel 47 Smid, Michiel H. M. 46 Chen, Danny Ziyi 44 Iliopoulos, Costas S. 42 Kratsch, Dieter 41 Bodlaender, Hans L. 41 Thilikos, Dimitrios M. 40 Levin, Asaf 40 Maheshwari, Anil 40 Tóth, Csaba D. 38 Eppstein, David Arthur 38 Wang, Jianxin 38 Zehavi, Meirav 37 Crochemore, Maxime 37 Dumitrescu, Adrian 37 Gutin, Gregory Z. 36 Heggernes, Pinar 36 Nutov, Zeev 35 Chen, Jian-er 34 Pelc, Andrzej 34 Pilipczuk, Michał 34 Raman, Venkatesh 33 Sau, Ignasi 33 Wang, Haitao 32 Doerr, Benjamin 32 Du, Donglei 32 Pilipczuk, Marcin 32 van Kreveld, Marc J. 31 Amir, Amihood 30 Agarwal, Pankaj Kumar 30 Ahn, Hee-Kap 30 Chan, Timothy Moon-Yew 30 Gudmundsson, Joachim 30 Hurtado, Ferran 30 Larsen, Kim Skak 30 Mitchell, Joseph S. B. 30 Wu, Chenchen 29 Angelini, Patrizio 29 Biedl, Therese C. 29 Cheong, Otfried 29 Lingas, Andrzej 29 Rutter, Ignaz 28 Chrobak, Marek 28 Demaine, Erik D. 28 Landau, Gad M. 27 Bae, Sang Won 27 Fernau, Henning 27 Frati, Fabrizio 27 Inenaga, Shunsuke 27 Kaplan, Haim 27 Makino, Kazuhisa 27 Marx, Dániel 27 Munro, J. Ian 27 Sgall, Jiří 26 Boyar, Joan F. 26 Didimo, Walter 26 Kratsch, Stefan 26 Nandy, Subhas Chandra 26 Paschos, Vangelis Th. 26 Rytter, Wojciech 26 Snoeyink, Jack Scott 26 Villanger, Yngve 26 Xu, Yinfeng 25 Cygan, Marek 25 Favrholdt, Lene Monrad 25 Goodrich, Michael Truman 25 Guibas, Leonidas John 25 Kaufmann, Michael 25 Löffler, Maarten 25 Mahmoud, Hosam M. 25 Mertzios, George B. 25 Montecchiani, Fabrizio 25 Morin, Pat 25 Otachi, Yota 25 van Stee, Rob 24 Edelsbrunner, Herbert 24 Feng, Qilong 24 Komusiewicz, Christian 24 Kortsarz, Guy 24 Langerman, Stefan 24 Navarra, Alfredo 24 Radoszewski, Jakub 24 Rawitz, Dror 24 Shachnai, Hadas 24 Woeginger, Gerhard Johannes 24 Wood, David Ronald 24 Yeo, Anders ...and 12,593 more Authors
all top 5

Cited in 544 Journals

 1,356 Theoretical Computer Science 1,124 Algorithmica 702 Discrete Applied Mathematics 558 Information Processing Letters 452 Computational Geometry 286 Journal of Computer and System Sciences 270 Journal of Combinatorial Optimization 232 Journal of Discrete Algorithms 228 Discrete & Computational Geometry 201 Theory of Computing Systems 199 International Journal of Computational Geometry & Applications 193 Mathematical Programming. Series A. Series B 189 European Journal of Operational Research 152 Discrete Mathematics 144 Information and Computation 141 International Journal of Foundations of Computer Science 135 SIAM Journal on Discrete Mathematics 128 SIAM Journal on Computing 114 Operations Research Letters 111 Computers & Operations Research 89 Distributed Computing 86 Annals of Operations Research 82 Discrete Optimization 75 Journal of Scheduling 65 European Journal of Combinatorics 60 Artificial Intelligence 57 Information Sciences 57 Networks 55 Optimization Letters 51 Algorithms 50 Graphs and Combinatorics 49 Random Structures & Algorithms 49 Journal of Global Optimization 48 Discrete Mathematics, Algorithms and Applications 45 Applied Mathematics and Computation 45 International Journal of Computer Mathematics 44 Computer Aided Geometric Design 44 Journal of Graph Algorithms and Applications 43 Real-Time Systems 43 Combinatorics, Probability and Computing 40 Journal of Combinatorial Theory. Series A 39 Journal of Combinatorial Theory. Series B 39 Journal of Optimization Theory and Applications 39 Mathematics of Operations Research 34 The Annals of Applied Probability 34 Linear Algebra and its Applications 31 Combinatorica 31 Pattern Recognition 29 Computational Complexity 29 INFORMS Journal on Computing 29 Quantum Information Processing 28 Acta Informatica 28 Journal of Computational and Applied Mathematics 28 Journal of Graph Theory 27 Advances in Applied Mathematics 27 Journal of Parallel and Distributed Computing 27 Computational Optimization and Applications 27 Annals of Mathematics and Artificial Intelligence 25 The Electronic Journal of Combinatorics 24 Journal of Mathematical Biology 24 Optimization 23 Computing 22 Journal of Mathematical Physics 22 Operations Research 22 Journal of Symbolic Computation 22 Games and Economic Behavior 21 Computers & Mathematics with Applications 21 Journal of Applied Probability 21 Journal of Complexity 20 Bulletin of Mathematical Biology 20 Computer Science Review 19 Advances in Applied Probability 19 Automatica 19 RAIRO. Operations Research 19 4OR 18 Journal of Statistical Physics 18 Journal of Heuristics 18 Mathematics in Computer Science 17 BIT 17 Mathematical and Computer Modelling 17 Stochastic Processes and their Applications 17 Optimization Methods & Software 16 Journal of Cryptology 16 Annals of Combinatorics 15 Computational Statistics and Data Analysis 15 International Transactions in Operational Research 15 Mathematical Problems in Engineering 14 Machine Learning 14 RAIRO. Theoretical Informatics and Applications 13 Journal of Computational Physics 13 Discussiones Mathematicae. Graph Theory 13 Parallel Algorithms and Applications 13 Natural Computing 13 Journal of Theoretical Biology 13 Journal of the Operations Research Society of China 12 Communications in Mathematical Physics 12 Computer Methods in Applied Mechanics and Engineering 12 Japan Journal of Industrial and Applied Mathematics 12 New Journal of Physics 12 Journal of Systems Science and Complexity ...and 444 more Journals
all top 5

Cited in 61 Fields

 7,637 Computer science (68-XX) 3,792 Combinatorics (05-XX) 2,899 Operations research, mathematical programming (90-XX) 696 Numerical analysis (65-XX) 588 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 459 Convex and discrete geometry (52-XX) 383 Probability theory and stochastic processes (60-XX) 378 Biology and other natural sciences (92-XX) 269 Information and communication theory, circuits (94-XX) 217 Statistics (62-XX) 159 Quantum theory (81-XX) 146 Number theory (11-XX) 84 Mathematical logic and foundations (03-XX) 79 Linear and multilinear algebra; matrix theory (15-XX) 77 Systems theory; control (93-XX) 68 Statistical mechanics, structure of matter (82-XX) 62 Geometry (51-XX) 55 Order, lattices, ordered algebraic structures (06-XX) 53 Mechanics of particles and systems (70-XX) 52 Calculus of variations and optimal control; optimization (49-XX) 39 Manifolds and cell complexes (57-XX) 36 Algebraic geometry (14-XX) 31 Group theory and generalizations (20-XX) 31 Mechanics of deformable solids (74-XX) 29 Fluid mechanics (76-XX) 26 Functional analysis (46-XX) 24 Partial differential equations (35-XX) 22 Algebraic topology (55-XX) 21 Differential geometry (53-XX) 20 Dynamical systems and ergodic theory (37-XX) 19 Approximations and expansions (41-XX) 16 Operator theory (47-XX) 15 General and overarching topics; collections (00-XX) 15 Harmonic analysis on Euclidean spaces (42-XX) 14 General topology (54-XX) 13 Field theory and polynomials (12-XX) 13 Commutative algebra (13-XX) 12 Measure and integration (28-XX) 12 Special functions (33-XX) 12 Ordinary differential equations (34-XX) 11 History and biography (01-XX) 11 Real functions (26-XX) 11 Difference and functional equations (39-XX) 9 Geophysics (86-XX) 7 Global analysis, analysis on manifolds (58-XX) 5 Functions of a complex variable (30-XX) 5 Sequences, series, summability (40-XX) 4 Associative rings and algebras (16-XX) 3 General algebraic systems (08-XX) 3 Category theory; homological algebra (18-XX) 3 Abstract harmonic analysis (43-XX) 2 Nonassociative rings and algebras (17-XX) 2 Potential theory (31-XX) 2 Astronomy and astrophysics (85-XX) 1 Topological groups, Lie groups (22-XX) 1 Several complex variables and analytic spaces (32-XX) 1 Integral transforms, operational calculus (44-XX) 1 Integral equations (45-XX) 1 Optics, electromagnetic theory (78-XX) 1 Classical thermodynamics, heat transfer (80-XX) 1 Mathematics education (97-XX)