Zobrazeno 1 - 10
of 709
pro vyhledávání: '"Dinér P"'
An edge-colored multigraph $G$ is rainbow connected if every pair of vertices is joined by at least one rainbow path, i.e., a path where no two edges are of the same color. In the context of multilayered networks we introduce the notion of multilayer
Externí odkaz:
http://arxiv.org/abs/2407.12323
Autor:
Abramowicz, H., Soto, M. Almanza, Altarelli, M., Aßmann, R., Athanassiadis, A., Avoni, G., Behnke, T., Benettoni, M., Benhammou, Y., Bhatt, J., Blackburn, T., Blanch, C., Bonaldo, S., Boogert, S., Borysov, O., Borysova, M., Boudry, V., Breton, D., Brinkmann, R., Bruschi, M., Burkart, F., Büßer, K., Cavanagh, N., Corso, F. Dal, Decking, W., Deniaud, M., Diner, O., Dosselli, U., Elad, M., Epshteyn, L., Esperante, D., Ferber, T., Firlej, M., Fiutowski, T., Fleck, K., Fuster-Martinez, N., Gadow, K., Gaede, F., Gallas, A., Cabrera, H. Garcia, Gerstmayr, E., Ghenescu, V., Giorato, M., Golubeva, N., Grojean, C., Grutta, P., Grzelak, G., Hallford, J., Hartman, L., Heinemann, B., Heinzl, T., Helary, L., Hendriks, L., Hoffmann, M., Horn, D., Huang, S., Huang, X., Idzik, M., Irles, A., Jacobs, R., King, B., Klute, M., Kropf, A., Kroupp, E., Lahno, H., Manghi, F. Lasagni, Lawhorn, J., Levanon, A., Levi, A., Levinson, L., Levy, A., Levy, I., Liberman, A., Liss, B., List, B., List, J., Lohmann, W., Maalmi, J., Madlener, T., Malka, V., Marsault, T., Mattiazzo, S., Meloni, F., Miron, D., Morandin, M., Moroń, J., Nanni, J., Neagu, A. T., Negodin, E., Paccagnella, A., Pantano, D., Pietruch, D., Pomerantz, I., Pöschl, R., Potlog, P. M., Prasad, R., Quishpe, R., Ranken, E., Ringwald, A., Roich, A., Salgado, F., Santra, A., Sarri, G., Sävert, A., Sbrizzi, A., Schmitt, S., Schulthess, I., Schuwalow, S., Seipt, D., Simi, G., Soreq, Y., Spataro, D., Streeter, M., Swientek, K., Hod, N. Tal, Teter, T., Thiebault, A., Thoden, D., Trevisani, N., Urmanov, R., Vasiukov, S., Walker, S., Warren, M., Wing, M., Yap, Y. C., Zadok, N., Zanetti, M., Żarnecki, A. F., Zbińkowski, P., Zembaczyński, K., Zepf, M., Zerwas, D., Ziegler, W., Zuffa, M.
This Technical Design Report presents a detailed description of all aspects of the LUXE (Laser Und XFEL Experiment), an experiment that will combine the high-quality and high-energy electron beam of the European XFEL with a high-intensity laser, to e
Externí odkaz:
http://arxiv.org/abs/2308.00515
Publikováno v:
LNCS 14422, Springer, 2023, pp. 168-181
Given a graph $G=(V, E)$ and a list of available colors $L(v)$ for each vertex $v\in V$, where $L(v) \subseteq \{1, 2, \ldots, k\}$, List $k$-Coloring refers to the problem of assigning colors to the vertices of $G$ so that each vertex receives a col
Externí odkaz:
http://arxiv.org/abs/2305.10108
Autor:
Ofek, E. O., Ben-Ami, S., Polishook, D., Segre, E., Blumenzweig, A., Strotjohann, N. L., Yaron, O., Shani, Y. M., Nachshon, S., Shvartzvald, Y., Hershko, O., Engel, M., Segre, M., Segev, N., Zimmerman, E., Nir, G., Judkovsky, Y., Gal-Yam, A., Zackay, B., Waxman, E., Kushnir, D., Chen, P., Azaria, R., Manulis, I., Diner, O., Vandeventer, B., Franckowiak, A., Weimann, S., Borowska, J., Garrappa, S., Zenin, A., Ramazani, V. Fallah, Konno, R., Kusters, D., Sadeh, I., Parsons, R. D., Berge, D., Kowalski, M., Ohm, S., Arcavi, I., Bruch, R.
The Large Array Survey Telescope (LAST) is a wide-field visible-light telescope array designed to explore the variable and transient sky with a high cadence. LAST will be composed of 48, 28-cm f/2.2 telescopes (32 already installed) equipped with ful
Externí odkaz:
http://arxiv.org/abs/2304.04796
Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving upper bounds o
Externí odkaz:
http://arxiv.org/abs/2211.03206
Autor:
Nir, Guy, Ofek, Eran O., Ben-Ami, Sagi, Segev, Noam, Polishook, David, Hershko, Ofir, Diner, Oz, Manulis, Ilan, Zackay, Barak, Gal-Yam, Avishay, Yaron, Ofer
A relatively unexplored phase space of transients and stellar variability is that of second and sub-second time-scales. We describe a new optical observatory operating in the Negev desert in Israel, with a 55 cm aperture, a field of view of 2.6x2.6 d
Externí odkaz:
http://arxiv.org/abs/2105.03436
We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph $(G,\varphi)$, i.e., a graph together with a coloring on its vertices. We can associate to each colored graph a cluster graph ($G_\varphi)$ in
Externí odkaz:
http://arxiv.org/abs/2103.12899
We introduce the block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class ${\cal G}$, the class ${\cal B}({\cal G})$ contains all graphs whose blocks belong to ${\cal G}$ and the cl
Externí odkaz:
http://arxiv.org/abs/2103.01872
3D convective cloud images form via two intertwined radiative diffusion processes. Sunlight starts in the anti-solar direction and ends in toward-sensor ones, but repeated forward-peaked scattering smears the well-collimated beams across_direction_ s
Externí odkaz:
http://arxiv.org/abs/2011.14537
List k-Coloring (Li k-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..,k}. The problem is known to be NP-hard even for k=3 within the class of
Externí odkaz:
http://arxiv.org/abs/2002.02729